Sciweavers

6 search results - page 1 / 2
» Symplectic Lattice Reduction and NTRU
Sort
View
128
Voted
EUROCRYPT
2006
Springer
15 years 8 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
ANTS
2006
Springer
91views Algorithms» more  ANTS 2006»
15 years 8 months ago
Practical Lattice Basis Sampling Reduction
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
Johannes Buchmann, Christoph Ludwig
153
Voted
CRYPTO
2007
Springer
143views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
To date the NTRUEncrypt security parameters have been based on the existence of two types of attack: a meet-in-the-middle attack due to Odlyzko, and a conservative extrapolation of...
Nick Howgrave-Graham
129
Voted
EUROCRYPT
2003
Springer
15 years 10 months ago
Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
Michael Szydlo
139
Voted
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
15 years 9 months ago
A Chosen-Ciphertext Attack against NTRU
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
Éliane Jaulmes, Antoine Joux