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 in computer science

Quantum Algorithms for Fast Correlation Attacks on LFSR-Based Stream Ciphers

Akinori Hosoyamada

Published Dec 11, 2024• 3 citations
Publisher
DOI
10.1007/978-981-96-0944-4_13

Related papers

The security of quantum noise stream cipher against collective attacks

Kai Wang, Jie Zhang

Quantum Information Processing•Jul 1, 2021•5 citations

Quantum Stream Ciphers: Impossibility of Unconditionally Strong Algorithms

P. A. Tregubov, Anton Sergeevich Trushechkin

Journal of Mathematical Sciences•Nov 21, 2020•1 citation

Immunity against Correlation Attack on Quantum Stream Cipher by Yuen 2000 Protocol

Osamu Hirota, Kaoru Kurosawa

arXiv:quant-ph/0604036•Quantum Information Processing•Nov 27, 2006•32 citations

A quantum stream cipher by Yuen 2000 protocol with nonlinear random number generator

Kentaro Kato, Osamu Hirota

A quantum stream cipher by Yuen 2000 (Y-00) protocol with a feedback shift register - a linear feedback shift register (LFSR) or a nonlinear feedback shift register - is very attractive in implementing a secure high-speed optical data transmission system for next-generation optical networking. So far, a LFSR has been used in a quantum stream cipher by Y-00 as a running key generator, rather than a nonlinear feedback shift register. But, it is well-known that an appropriately designed nonlinear feedback shift register has larger period and linear complexity than the corresponding quantities of a LFSR driven by a secret key of the same length. Although large linear complexity of a key generator does not immediately guarantee the security of the key generator itself, it forces the eavesdropper at least to collect more measurement data to carry out the attacks. This motivates us to use a nonlinear feedback shift register as a running key generator in a quantum stream cipher by Y-00. The purpose of this study is to make a quantum stream cipher more costly in terms of cryptoanalysis, enhancing the advantages of using a nonlinear feedback shift register. For this purpose, we propose a new randomization technique for a running key generator in this paper. First, we state the basics of a quantum stream cipher by Y-00. Second, we propose the randomization on a running key consisting of two different type of basis converter. To evaluate the effect of the randomization in terms of the amount of information that is extracted by her measurement, numerical simulation is performed in the cases of an optical heterodyne receiver and a quantum optimal receiver under the assumption that the eavesdropper knows plaintext. Finally, we summarize the results.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Sep 5, 2008•3 citations

Analysis of Atom against quantum attacks

Ravi Anand, Rimpa Nandi, Takanori Isobe

Abstract A significant amount of study is being done to review the security promises made for the various ciphers now in use as a result of the development of quantum computing technology. A general attack against symmetric key cryptography primitives that can reduce search costs to the square root is Grover's search algorithm. To implement Grover's algorithm, it is necessary that the target cipher be implemented as a quantum circuit. Despite being relatively new, this area of study has received significant attention from the research community. The authors have estimated the cost of Grover's key search attack against the stream cipher Atom, for the first time, under circuit depth restrictions defined in National Institute of Standards and Technology (NIST) PQC standardisation process. The authors implement the quantum circuit of Atom in QISKIT, (open‐source software development kit for working with quantum computers running on IBM Quantum Experience). The results are also compared with other existing literature on LFSR‐based stream ciphers, such as Grain‐v1, Grain‐128‐AEAD, and Lizard. The authors also find that, to the best of their knowledge, in the existing literature on estimating the cost of Grover's attack on symmetric ciphers, Atom is the only 128‐bit key cipher that meets the threshold of ≈2 170 set by NIST for quantum security of 128‐bit key ciphers. The authors also analyse the security of Atom against quantum TMDTO attacks.

IET Quantum Communication•Nov 9, 2023•5 citations

Quantum Stream Cipher for Secure Communication

Fumio Futami, Osamu Hirota

•Jan 1, 2014•0 citations
A quantum stream cipher by Yuen 2000 (Y-00) protocol with a feedback shift register - a linear feedback shift register (LFSR) or a nonlinear feedback shift register - is very attractive in implementing a secure high-speed optical data transmission system for next-generation optical networking. So far, a LFSR has been used in a quantum stream cipher by Y-00 as a running key generator, rather than a nonlinear feedback shift register. But, it is well-known that an appropriately designed nonlinear feedback shift register has larger period and linear complexity than the corresponding quantities of a LFSR driven by a secret key of the same length. Although large linear complexity of a key generator does not immediately guarantee the security of the key generator itself, it forces the eavesdropper at least to collect more measurement data to carry out the attacks. This motivates us to use a nonlinear feedback shift register as a running key generator in a quantum stream cipher by Y-00. The purpose of this study is to make a quantum stream cipher more costly in terms of cryptoanalysis, enhancing the advantages of using a nonlinear feedback shift register. For this purpose, we propose a new randomization technique for a running key generator in this paper. First, we state the basics of a quantum stream cipher by Y-00. Second, we propose the randomization on a running key consisting of two different type of basis converter. To evaluate the effect of the randomization in terms of the amount of information that is extracted by her measurement, numerical simulation is performed in the cases of an optical heterodyne receiver and a quantum optimal receiver under the assumption that the eavesdropper knows plaintext. Finally, we summarize the results.
Abstract A significant amount of study is being done to review the security promises made for the various ciphers now in use as a result of the development of quantum computing technology. A general attack against symmetric key cryptography primitives that can reduce search costs to the square root is Grover's search algorithm. To implement Grover's algorithm, it is necessary that the target cipher be implemented as a quantum circuit. Despite being relatively new, this area of study has received significant attention from the research community. The authors have estimated the cost of Grover's key search attack against the stream cipher Atom, for the first time, under circuit depth restrictions defined in National Institute of Standards and Technology (NIST) PQC standardisation process. The authors implement the quantum circuit of Atom in QISKIT, (open‐source software development kit for working with quantum computers running on IBM Quantum Experience). The results are also compared with other existing literature on LFSR‐based stream ciphers, such as Grain‐v1, Grain‐128‐AEAD, and Lizard. The authors also find that, to the best of their knowledge, in the existing literature on estimating the cost of Grover's attack on symmetric ciphers, Atom is the only 128‐bit key cipher that meets the threshold of ≈2 170 set by NIST for quantum security of 128‐bit key ciphers. The authors also analyse the security of Atom against quantum TMDTO attacks.