A Lattice-Based Public-Key Cryptosystem

Information and Computation

Volumn 151, Issue 1-2, 1999, Pages 17-31

  Cai, Jin Yi ^a   Cusick, Thomas W ^b  

^a State University of New York   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

Cryptographic security; Lattice; Public key cryptosystem

Indexed keywords

EID: 0346499215     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2762     Document Type: Article

References (17)

1. Ajtai, M. (1996), Generating hard instances of lattice problems, in "Proc. 28th Annual ACM Symposium on the Theory of Computing," pp. 99-108. [Full version available from ECCC, Electronic Colloquium on Computational Complexity TR96-007, at http://www.eccc.uni-trier.de/eccc/]
2. 2 is NP-hard for randomized reductions, Electronic Colloquium on Computational Complexity TR97-047, at http://www.eccc.uni-trier.de/eccc/.
3. Ajtai, M., and Dwork, C. (1997), A public-key cryptosystem with worst-case/average-case equivalence, in "Proc. 29th Annual ACM Symposium on the Theory of Computing," pp. 284-293.
4. Arora, S., Babai, L., Stern, J., and Sweedyk, Z. (1993), The hardness of approximate optima in lattices, codes, and systems of linear equations, in "Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS)," pp. 724-733.
5. Cai, J-Y., and Nerurkar, A. (1997), An improved worst-case to average-case connection for lattice problems, in "Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS)," pp. 468-477.
6. ε) is NP-hard under randomized reductions, Electronic Colloquium on Computational Complexity TR97-059, at http://www.eccc.uni-trier.de/eccc/.
7. Cai, J-Y. (1998), A primal-dual relation for lattices and the complexity of shortest lattice vector problem, Theoret. Comput. Sci., to appear.
8. Cai, J-Y. (1998), A new transference theorem and applications to Ajtai's connection factor, Electronic Colloquium on Computational Complexity TR98-005, at http://www.eccc.uni-trier.de/eccc/.
9. Goldreich, O., and Goldwasser, S. (1997), On the limits of non-approximability of lattice problems, Electronic Colloquium on Computational Complexity TR97-031, at http://www.eccc.uni-trier.de/eccc/.
10. Goldreich, O., Goldwasser, S., and Halevi, S. (1996), Collision-free hashing from lattice problems, Electronic Colloquium on Computational Complexity TR96-042, at http://www.eccc.uni-trier.de/eccc/.
11. Goldreich, O., Goldwasser, S., and Halevi, S. (1997), Public-key cryptosystems from lattice reduction problems, in "Advances in Cryptology - CRYPTO '97," Lecture Notes in Computer Science, Vol. 1294, Springer-Verlag, New York/Berlin, pp. 112-131.
12. Lagarias, J. C. (1985), The computational complexity of simultaneous diophantine approximation problems, SIAM J. Comput. 14, 196-209.
13. Lagarias, J. C., Lenstra, H. W., and Schnorr, C. P. (1990), Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica 10, 333-348.
14. Lenstra, A. K., Lenstra, H. W., and Lovász, L. (1982), Factoring polynomials with rational coefficients, Math. Ann. 261, 515-534.
15. Odlyzko, A. M. (1990), The rise and fall of knapsack cryptosystems, in "Cryptology and Computational Number Theory," pp. 75-88, Am. Math. Soc., Providence, RI.
16. Schnorr, C. P. (1987), A hierarchy of polynomial time lattice basis reduction algorithms, Theoret. Comput. Sci. 53, 201-224.
17. van Emde Boas, P. (1981), Another NP-complete partition problem and the complexity of computing short vectors in lattices, Technical Report 81-04, Mathematics Department, University of Amsterdam.