Paper 1999/005

Lattice Based Cryptography: A Global Improvement

Daniele Micciancio


We describe a general technique to simplify as well as to improve several lattice based cryptographic protocols. The technique is rather straightforward and is easily applied to the protocols, and gives both a simpler analysis and better performance than the original protocols. The improvement is global: the modified protocols are simpler, faster, require less storage, use less bandwidth and need less random bits than the originals. Moreover, the improvement is achieved without any loss in security: we formally prove that the modified protocols are at least as secure as the original ones. In fact, the modified protocols might even be more secure as the adversary gets less information. We exemplify our technique on the Goldreich-Goldwasser zero-knowledge proof systems for lattice problems and the GGH public key cryptosystem.

Available format(s)
Publication info
Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
latticescoAMencryptionpublic key.
Contact author(s)
miccianc @ theory lcs mit edu
1999-03-04: received
Short URL
Creative Commons Attribution


      author = {Daniele Micciancio},
      title = {Lattice Based Cryptography: A Global Improvement},
      howpublished = {Cryptology ePrint Archive, Paper 1999/005},
      year = {1999},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.