Paper 2016/1050

Cryptographic decoding of the Leech lattice

Alex van Poppelen


Advancements in quantum computing have spurred the development of new asymmetric cryptographic primitives that are conjectured to be secure against quantum attackers. One promising class of these primitives is based on lattices, leading to encryption protocols based on the Learning With Errors (LWE) problem. Key exchange algorithms based on this problem are computationally efficient and enjoy on a strong worst-case hardness guarantee. However, despite recent improvements, the resulting handshake sizes are still significantly larger than those in use today. This thesis looks at the possibility of applying the Leech lattice code to one such scheme, with the goal of decreasing the size of the resulting handshake. We also look at the feasibility of a cryptographically safe implementation of a Leech lattice decoder (available at, and the resulting impact on efficiency.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere.
public-key cryptographykey exchangeLWElattice cryptographyleech latticeimplementation
Contact author(s)
avanpoppelen @ gmail com
2016-11-17: last of 2 revisions
2016-11-15: received
See all versions
Short URL
Creative Commons Attribution


      author = {Alex van Poppelen},
      title = {Cryptographic decoding of the Leech lattice},
      howpublished = {Cryptology ePrint Archive, Paper 2016/1050},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.