Cryptology ePrint Archive: Report 2019/1027

Quantum LLL with an Application to Mersenne Number Cryptosystems

Marcel Tiepelt and Alan Szepieniec

Abstract: In this work we analyze the impact of translating the well-known LLL algorithm for lattice reduction into the quantum setting. We present the first (to the best of our knowledge) quantum circuit representation of a lattice reduction algorithm in the form of explicit quantum circuits implementing the textbook LLL algorithm. Our analysis identifies a set of challenges arising from constructing reversible lattice reduction as well as solutions to these challenges. We give a detailed resource estimate with the Toffoli gate count and the number of logical qubits as complexity metrics.

As an application of the previous, we attack Mersenne number cryptosystems by Groverizing an attack due to Beunardeau et. al that uses LLL as a subprocedure. While Grover's quantum algorithm promises a quadratic speedup over exhaustive search given access to a oracle that distinguishes solutions from non-solutions, we show that in our case, realizing the oracle comes at the cost of a large number of qubits. When an adversary translates the attack by Beunardeau et al. into the quantum setting, the overhead of the quantum LLL circuit may be as large as $2^{52}$ qubits for the text-book implementation and $2^{33}$ for a floating-point variant.

Category / Keywords: quantum attack, lattice reduction, Grover's algorithm, Mersenne number cryptosystems

Original Publication (with minor differences): LATINCRYPT 2019, LNCS 11774

Date: received 10 Sep 2019, last revised 7 Feb 2020

Contact author: tiepelt at dev-nu11 de

Available format(s): PDF | BibTeX Citation

Version: 20200207:072818 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]