Clémence Chevignard
Univ Rennes, Inria, CNRS, IRISA, Rennes, France

Pierre-Alain Fouque
Univ Rennes, Inria, CNRS, IRISA, Rennes, France

André Schrottenloher
Univ Rennes, Inria, CNRS, IRISA, Rennes, France

Keywords: Prange’s Algorithm, Quantum Search, Information Set Decoding,Quantum Cryptanalysis.

Abstract

This paper presents an optimization of the memory cost of the quantum Information Set Decoding (ISD) algorithm proposed by Bernstein (PQCrypto 2010), obtained by combining Prange's ISD with Grover's quantum search.

When the code has constant rate and length n, this algorithm essentially performs a quantum search which, at each iteration, solves a linear system of dimension O(n). The typical code lengths used in post-quantum public-key cryptosystems range from 10³ to 10⁵. Gaussian elimination, which was used in previous works, needs O(n²) space to represent the matrix, resulting in millions or billions of (logical) qubits for these schemes.

In this paper, we propose instead to use the algorithm for sparse matrix inversion of Wiedemann (IEEE Trans. inf. theory 1986). The interest of Wiedemann's method is that one relies only on the implementation of a matrix-vector product, where the matrix can be represented in an implicit way. This is the case here.

We give two main trade-offs, which we have fully implemented, tested on small instances, and benchmarked for larger instances. The first one is a quantum circuit using O(n) qubits, O(n³) Toffoli gates like Gaussian elimination, and depth O(n² log n). The second one is a quantum circuit using O(n log² n) qubits, O(n³) gates in total but only O(n² log² n) Toffoli gates, which relies on a different representation of the search space.

As an example, for the smallest Classic McEliece parameters we estimate that the Quantum Prange's algorithm can run with 18098 qubits, while previous works would have required at least half a million qubits.