Sciweavers

13 search results - page 3 / 3
» Parallel Lattice Basis Reduction Using a Multi-threaded Schn...
Sort
View
TOC
2008
94views more  TOC 2008»
13 years 5 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
CRYPTO
2000
Springer
175views Cryptology» more  CRYPTO 2000»
13 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
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 3 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger