Public-key cryptosystems from lattice reduction problems

  • Oded Goldreich
  • Shafi Goldwasser
  • Shai Halevi
Conference paper

DOI: 10.1007/BFb0052231

Volume 1294 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

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

Public-Key Cryptosystems Lattice Reduction Problems 
Download to read the full conference paper text

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Oded Goldreich
    • 1
    • 2
  • Shafi Goldwasser
    • 1
    • 2
  • Shai Halevi
    • 1
    • 2
  1. 1.Weizmann Institute of ScienceIsrael
  2. 2.Laboratory for Computer ScienceMITIsrael