Cryptology ePrint Archive: Report 2016/1050

Cryptographic decoding of the Leech lattice

Alex van Poppelen

Abstract: 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.

Category / Keywords: public-key cryptography / public-key cryptography, key exchange, LWE, lattice cryptography, leech lattice, implementation

Original Publication (in the same form):

Date: received 5 Nov 2016, last revised 17 Nov 2016

Contact author: avanpoppelen at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20161117:195001 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]