Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

A Quantum Circuit to Speed-Up the Cryptanalysis of Code-Based Cryptosystems

Simone Perriello, Alessandro Barenghi, Gerardo Pelosi

Published Jan 1, 2021• 11 citations
Publisher
DOI
10.1007/978-3-030-90022-9_25

Related papers

Quantum circuits for cryptanalysis

Brittanney Amento

•Jan 1, 2016•0 citations

Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity under Quantum Environment

Zhengjun Jing, Chunsheng Gu, Chunpeng Ge +1 more

Mobile Networks and Applications•Jan 27, 2020•4 citations

Cryptanalysis of a Public Key Cryptosystem Based on Data Complexity Under Quantum Environment

Zhengjun Jing, Chunsheng Gu, Peizhong Shi

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2019•0 citations

A High-speed Quantum Cryptosystem

Akio Tajima, Akihiro Tanaka, Wakako Maeda +4 more

IEICE Technical Report; IEICE Tech. Rep.•May 16, 2005•0 citations

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem

Jonathan Conrad, Jens Eisert, Jean‐Pierre Seifert

We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are g o o d in that they exhibit constant rate and average distance scaling Δ ∝ n with high probability, where n is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that d e c o d i n g for a stochastic displacement noise model is equivalent to d e c r y p t i n g the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem.

arXiv:2303.02432•Quantum•Jul 4, 2024•18 citations

Estimates of Implementation Complexity for Quantum Cryptanalysis of Post-Quantum Lattice-Based Cryptosystems

Alexander Olegovich Bakharev

Abstract Due to the development of quantum computing, there is a need for the development and analysis of cryptosystems resistant to attacks using a quantum computer (post-quantum cryptography algorithms). The security of many well-known post-quantum cryptosystems based on lattice theory depends on the complexity of solving the shortest vector problem (SVP). In this paper, a model of quantum oracle developed from Grover’s algorithm is described to implement a hybrid quantum–classical algorithm based on GaussSieve. This algorithm can be used for attacks on cryptosystems whose security depends on solving the SVP. Upper bounds for the number of qubits and the depth of the circuit were obtained for two implementations of the proposed quantum oracle model: minimizing the number of qubits and minimizing the circuit depth. The complexity of implementing the proposed quantum oracle model to attack post-quantum lattice-based cryptosystems that are finalists of the NIST post-quantum cryptography competition is analyzed.

Journal of Applied and Industrial Mathematics•Sep 1, 2023•1 citation
We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are g o o d in that they exhibit constant rate and average distance scaling Δ ∝ n with high probability, where n is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that d e c o d i n g for a stochastic displacement noise model is equivalent to d e c r y p t i n g the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem.
Abstract Due to the development of quantum computing, there is a need for the development and analysis of cryptosystems resistant to attacks using a quantum computer (post-quantum cryptography algorithms). The security of many well-known post-quantum cryptosystems based on lattice theory depends on the complexity of solving the shortest vector problem (SVP). In this paper, a model of quantum oracle developed from Grover’s algorithm is described to implement a hybrid quantum–classical algorithm based on GaussSieve. This algorithm can be used for attacks on cryptosystems whose security depends on solving the SVP. Upper bounds for the number of qubits and the depth of the circuit were obtained for two implementations of the proposed quantum oracle model: minimizing the number of qubits and minimizing the circuit depth. The complexity of implementing the proposed quantum oracle model to attack post-quantum lattice-based cryptosystems that are finalists of the NIST post-quantum cryptography competition is analyzed.