Paper 2015/1120

Even More Practical Key Exchanges for the Internet using Lattice Cryptography

Vikram Singh and Arjun Chopra


In 2014, Peikert described the first practical lattice-based key exchange that is provably secure and provides perfect forward security. However, his presentation lacks concrete proposals for parameters. We aim to provide a clear description of how the algorithm can be implemented along with some analysis for potential parameters. Previously in 2015, Singh considered the simpler case, as chosen by Bos, Costello, Naehrig and Steblia in 2014, of cyclotomic rings with power-of-two degree. In this work we focus on the case of cyclotomic rings with degree p-1 for prime p. This allows for a greater degree of flexibility in choosing lattice dimension, which determines the security level and efficiency of the scheme. We describe the necessary arithmetic setup and then present Peikert's Diffie-Hellman-like key exchange along with security, correctness and implementation analysis.

Note: Add benchmarking information

Available format(s)
Publication info
Preprint. MINOR revision.
CryptographyLatticeRing-LWERing Learning With ErrorsKey ExchangeIKETLS
Contact author(s)
vs77814 @ gmail com
2015-12-22: revised
2015-11-19: received
See all versions
Short URL
Creative Commons Attribution


      author = {Vikram Singh and Arjun Chopra},
      title = {Even More Practical Key Exchanges for the Internet using Lattice Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1120},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.