New lattice-based cryptographic constructions

Journal of the ACM

Volumn 51, Issue 6, 2004, Pages 899-942

  Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Average case hardness; Cryptography; Lattice; Public key encryption; Quantum computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; QUANTUM THEORY; SECURITY OF DATA; VECTORS;

AVERAGE-CASE HARDNESS; LATTICE; PUBLIC KEY ENCRYPTION; QUANTUM COMPUTING;

PUBLIC KEY CRYPTOGRAPHY;

EID: 20444451186     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1039488.1039490     Document Type: Article

References (28)

1. AJTAI, M. 1996. Generating hard instances of lattice problems. In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports.
2. AJTAI, M., AND DWORK, C. 1997. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing. ACM, New York, 284-293.
3. BANASZCZYK, W. 1993. New bounds in some transference theorems in the geometry of numbers. Math. Annal. 296, 4, 625-635.
4. CAI, J.-Y. 1999. Applications of a new transference theorem to Ajtai's connection factor. In Proceedings of the 14th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., pp. 205-214.
5. CAI, J.-Y., AND NERURKAR, A. P. 1997. An improved worst-case to average-case connection for lattice problems (extended abstract). In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 468-477.
6. EBELING, W. 2002. Lattices and codes, Advanced Lectures in Mathematics. Friedr. Vieweg & Sohn, Braunschweig. Revised edition. (A course partially based on lectures by F. Hirzebruch.)
7. ETTINGER, M., AND HÈYER, P. 2000. On quantum algorithms for noncommutative hidden subgroups. Adv. in Appl. Math. 25, 3, 239-251.
8. FRIEDL, K., IVANYOS, G., MAGNIEZ, F., SANTHA, M., AND SEN, P. 2003. Hidden translation and orbit coset in quantum computing. In Proceedings of the 35th ACM Symposium on Theory of Computing. ACM, New York, 1-9.
9. GOLDREICH, O., GOLDWASSER, S., AND HALEVI, S. 1996. Collision-free hashing from lattice problems. In ECCCTR: Electronic Colloquium on Computational Complexity (technical reports).
10. GOLDREICH, O., GOLDWASSER, S., AND HALEVI, S. 1997a. Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In Advances in Cryptology. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, New York, pp. 105-111.
11. GOLDREICH, O., GOLDWASSER, S., AND HALEVI, S. 1997b. Public-key cryptosystems from lattice reduction problems. In Advances in Cryptology. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, New York, pp. 112-131.
12. GOLDREICH, O., MICCIANCIO, D., SAFRA, S., AND SEIFERT, J.-P. 1999. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Proc. Lett. 71, 2, 55-61.
13. GRIGNI, M., SCHULMAN, L. J., VAZIRANI, M., AND VAZIRANI, U. V. 2001. Quantum mechanical algorithms for the non-Abelian hidden subgroup problem. In Proceedings of the 33rd ACM Symposium on Theory of Computing. ACM, New York, 68-74.
14. HALLGREN, S., RUSSELL, A., AND TA-SHMA, A. 2000. Normal subgroup reconstruction and quantum computation using group representations. In Proceedings of the 32nd ACM Symposium on Theory of Computing. ACM, New York, 627-635.
15. HOFFSTEIN, J., PIPHER, J., AND SILVERMAN, J. H. 1998. NTRU: A ring-based public key cryptosystem. In Algorithmic Number Theory. Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, New York, pp. 267-288.
16. IMPAGLIAZZO, R., AND NAOR, M. 1996. Efficient cryptographic schemes provably as secure as subset sum. J. Crypt. 9, 4, 199-216.
17. JOHANNES, K., UWE, S., AND JACOBO, T. 1993. The graph isomorphism problem: Its structural complexity. Birkhäuser Boston Inc., Boston, Mass.
18. KUPERBERG, G. 2003. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In quant-ph/0302112, http://xxx.lanl.gov.
19. LENSTRA, A. K., LENSTRA, JR., H. W., AND LOVASZ, L. 1982. Factoring polynomials with rational coefficients. Math. Ann. 261, 4, 515-534.
20. MICCIANCIO, D. 2001. Improving lattice based cryptosystems using the hermite normal form. In Cryptography and Lattices Conference (CaLC) (Providence, R. I., Mar.). Lecture Notes in Computer Science, vol. 2146, Springer-Verlag, New York, pp. 126-145.
21. MICCIANCIO, D. 2002a. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (Vancouver, B. C. Canada, Nov.). IEEE Computer Society Press, Los Alamitos, Calif.
22. MICCIANCIO, D. 2002b. Improved cryptographic hash functions with worst-case/average-case connection. In Proceedings of the 34th ACM Symposium on Theory of Computing (Montreal, Ont., Canada). ACM, New York, 609-618.
23. MICCIANCIO, D., AND GOLDWASSER, S. 2002. Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer, Boston, Mass.
24. MICCIANCIO, D., AND REGEV, O. 2004. Worst-case to average-case reductions based on Gaussian measures. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif, pp. 372-381.
25. REGEV, O. 2002. Quantum computation and lattice problems. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (Vancouver, B.C., Canada. Nov.). IEEE Computer Society Press, Los Alamitos, Calif.
26. ROTTELER, M., AND BETH, T. 1998. Polynomial-time solution to the hidden subgroup problem for a class of non-Abelian groups. In quant-ph/9812070, http://xxx.lanl.gov.
27. SHOR, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5, 1484-1509.
28. STEFANKOVIC, D. 2003 Fourier transforms in computer science. Master's Thesis TR-2002-03. Dept. Comput. Sci., University of Chicago, Chicago, Ill.