Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography

Authors:
Roger Fischlin;Jean-Pierre Seifert
Affiliations:
-;-
Venue:
Proceedings of the 7th IMA International Conference on Cryptography and Coding
Year:
1999

Citing 1
Cited 5

On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica

Improving Lattice Based Cryptosystems Using the Hermite Normal Form

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Broadcast Attacks against Lattice-Based Cryptosystems

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Recursive lattice reduction

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Improving BDD cryptosystems in general lattices

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which resembles the McEliece scheme.