Dimension reduction methods for convolution modular lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2146, Issue , 2001, Pages 110-125

  May, Alexander ^a   Silverman, Joseph H ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b BROWN UNIVERSITY   (United States)

Author keywords

Convolution modular lattice; Cryptography; Lattice reduction

Indexed keywords

CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS;

DIMENSION REDUCTION METHOD; LATTICE REDUCTION; PARALLEL AND DISTRIBUTED COMPUTING;

CONVOLUTION;

EID: 84958959970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44670-2_10     Document Type: Conference Paper

References (19)

1. M. Ajtai, The shortest vector problem in 2 is NP-hard for randomized reductions, Proc. 30th ACM Symposium on the Theory of Computing, pages 10-19, 1998
2. M. Ajtai, R. Kumar, D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, Proc. 33rd ACM Symposium on Theory of Computing, 2001 (to appear)
3. J.W.S. Cassels, An Introduction to the Geometry of Numbers, Die Grundlehren Der Mathematischen Wissenschaften, Springer-Verlag, 1959.
4. O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptography from lattice reduction problems, CRYPTO’97, Lect. Notes in Computer Science 1294, Springer-Verlag, 1997, 112-131.
5. O. Goldreich, D. Micciancio, S. Safra and J.P. Seifert, Approximating shortest lattice vectors is not harder than approximating closest vectors, Information Processing Letters, vol. 71, pp. 55-61, 1999.
6. J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: A new high speed public key cryptosystem, in Algorithmic Number Theory (ANTS III), Portland, OR, June 1998, Lecture Notes in Computer Science 1423 (J.P. Buhler, ed.), Springer-Verlag, Berlin, 1998, 267-288.
7. J. Hoffstein, J. Pipher, J.H. Silverman, NSS: An NTRUL attice-Based Signature Scheme, Advances in Cryptology—Eurocrypt 2001, Lecture Notes in Computer Science, Springer-Verlag, 2001.
8. J. Hoffstein, J. Pipher, J.H. Silverman, The NTRUSi gnature Scheme: Theory and Practice, preprint, June 2001.
9. IEEE P1363.1, Standard Specification for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices, Draft 2, 2001.
10. Number Theory Library, Victor Shoup, http://www.cs.wisc.edu/~shoup/ntl
11. H. Koy, C.-P. Schnorr, Segment LLL-Reduction of Lattice Bases, Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science, Springer-Verlag, this volume.
12. H. Koy, C.-P. Schnorr, Segment LLL-Reduction with Floating Point Orthogonalization, Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science, Springer-Verlag, this volume.
13. A.K. Lenstra, H.W. Lenstra Jr., L. Lovász, Factoring polynomials with rational coefficients, Mathematische Ann. 261 (1982), 513-534.
14. A. May, Auf Polynomgleichungen basierende Public-Key-Kryptosysteme, Johann Wolfgange Goethe-Universitat, Frankfurt am Main, Fachbereich Informatik. (Masters Thesis in Computer Science, 4 June, 1999; Thesis advisor C.P. Schnorr).
15. A. May, Cryptanalysis of NTRU-107, preprint, April 1999 (unpublished).
16. D. Micciancio, The Shortest Vector in a Lattice is Hard to Approximate within Some Constant, Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 92-98, 1998
17. P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem, Advances in Cryptology - Proceedings of CRYPTO’99, M. Wiener (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1999.
18. C.P. Schnorr, M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, Math. Programming 66 (1994), no. 2, Ser. A, 181-199.
19. C.P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, pages 201-224, 1987