Abstract
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA and DSS.
Keywords
This research was done while visiting in the Laboratory for Computer Science, MIT.
This research was supported by DARPA grant DABT63-96-C-0018.
Download to read the full chapter text
Chapter PDF
References
M. Ajtai. Generating hard instances of lattice problems. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 99–108, 1996.
M. Ajtai and C. Dwork. A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence, In 29th ACM Symposium on Theory of Computing, pages 284–293, 1997.
S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optimia in lattices, codes, and systems of linear equations. In Journal of Computer and System Sciences, 54(2), pages 317–331, 1997.
L. Babai, On Lovász lattice reduction and the nearest lattice point problem, in Combinatorica, vol. 6, 1986, pp. 1–13.
M. Blum and S. Goldwasser. An Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information, in Proceedings of CRYPTO '84, Springer-Verlag, 1985, pp. 289–299.
P. van Emde Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice. Reprot 81-04, Mathematische Instituut, University of Amsterdam, 1981.
Digital Signature Standard (DSS). FIPS PUB 186, 1994.
W. Diffie and M.E. Hellman. New Directions In Cryptography. IEEE Transactions on Information Theory, Vol IT-22, 1976, pp. 644–654.
T. El-Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Information Theory, vol. 31, 1985, pp. 469–472
O. Goldreich, S. Goldwasser and S. Halevi Collision-Free Hashing from Lattice Problems. Theory of Cryptography Library: Record 96-09. Available from http://theory.lcs.mit.edu/~tcryptol/1996/96-09.html
O. Goldreich, S. Goldwasser and S. Halevi Public-Key Cryptosystems from Lattice Reductions Problems. ECCC Report TR96-056. Available from http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1996.html
O. Goldreich and L.A. Levin A Hard-Core Predicate for All One-Way Functions Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 25–32
S. Goldwasser and S. Micali, Probabilistic Encryption. Journal of Computer and System Sciences, Vol. 28, 1984, pp. 270–299.
S. Goldwasser, S. Micali and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack. SIAM Journal on Computing, Vol. 17, no. 2, 1988, pp. 281–308.
R. Kannan. Algorithmic Geometry of Numbers. in Annual Review of Computer Science, vol. 2, 1987, Annual Reviews Inc.
The LiDIA project software-package and user-manual. Available from http: //www.informatik.th-darmstadt.de/TI/LiDIA/
A.K. Lenstra, H.W. Lenstra, L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982).
R.J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory. DSN Progress Report 42-44, Jet Propulsion Laboratory
M.O. Rabin, Digital Signatures and Public-Key Functions as Intractable as Factorization. Technical Report MIT/LCS/TR-212, M.I.T., 1978.
R.L. Rivest, A. Shamir and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Vol. 21, 1978, pp. 120–126.
C.P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. in Theoretical Computer Science, vol. 53, 1987, pp. 201–224
C.P. Schnorr and H.H. Horner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, in Proceedings of EUROCRYPT '95, Louis C. Guillou and Jean-Jacques Quisquater, editors. Lecture Notes in Computer Science, volume 921, Springer-Verlag, 1995. pp. 1–12
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Goldreich, O., Goldwasser, S., Halevi, S. (1997). Public-key cryptosystems from lattice reduction problems. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052231
Download citation
DOI: https://doi.org/10.1007/BFb0052231
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive