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

Physical Review A

Running key mapping in a quantum stream cipher by the Yuen 2000 protocol

Tetsuya Shimizu, Osamu Hirota, Yuki Nagasako

Published Mar 27, 2008• 25 citations
Publisher

Abstract

A quantum stream cipher by Yuen 2000 protocol (so-called Y00 protocol or $\ensuremath{\alpha}\ensuremath{\eta}$ scheme) consisting of linear feedback shift register of short key is very attractive in implementing secure 40 Gbits/s optical data transmission, which is expected as a next-generation network. However, a basic model of the Y00 protocol with a very short key needs a careful design against fast correlation attacks as pointed out by Donnet et al. This Brief Report clarifies an effectiveness of irregular mapping between running key and physical signals in the driver for selection of $M$-ary basis in the transmitter, and gives a design method. Consequently, quantum stream cipher by the Y00 protocol with our mapping has immunity against the proposed fast correlation attacks on a basic model of the Y00 protocol even if the key is very short.

DOI
10.1103/physreva.77.034305

Related papers

An immunity against correlation attack on quantum stream cipher by Yuen 2000 protocol

Osamu Hirota, Kaoru Kurosawa

This paper presents the security analysis on the quantum stream cipher so called Yuen-2000 protocol (or $αη$ scheme) against the fast correlation attack, the typical attack on stream ciphers. Although a very simple experimental model of the quantum stream cipher without a random mapper may be decrypted in the information theoretic sense by the fast correlation algorithm, it is not a basic feature of Yuen 2000 protocol. In fact, we clarify that there exists a randomization scheme which attains the perfect correlation immunity against such attacks under an approximation. And in this scheme, the running key correlation from the second randomization that determines the mapping patterns is dismissed also by quantum noise. In such a case, any fast correlation attack does not work on the quantum stream cipher.

arXiv:quant-ph/0604036•Apr 6, 2006•1 citation

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

Practical security analysis of a quantum stream cipher by the Yuen 2000 protocol

Osamu Hirota

There exists a great gap between one-time pad with perfect secrecy and conventional mathematical encryption. The Yuen 2000 (Y00) protocol or $\ensuremath{\alpha}\ensuremath{\eta}$ scheme may provide a protocol which covers from the conventional security to the ultimate one, depending on implementations. This paper presents the complexity-theoretic security analysis on some models of the Y00 protocol with nonlinear pseudo-random-number-generator and quantum noise diffusion mapping (QDM). Algebraic attacks and fast correlation attacks are applied with a model of the Y00 protocol with nonlinear filtering like the Toyocrypt stream cipher as the running key generator, and it is shown that these attacks in principle do not work on such models even when the mapping between running key and quantum state signal is fixed. In addition, a security property of the Y00 protocol with QDM is clarified. Consequently, we show that the Y00 protocol has a potential which cannot be realized by conventional cryptography and that it goes beyond mathematical encryption with physical encryption.

Physical Review A•Sep 7, 2007•67 citations

Quantum stream cipher by the Yuen 2000 protocol: Design and experiment by an intensity-modulation scheme

Osamu Hirota, Masaki Sohma, Masaru Fuse +1 more

We investigate the Yuen 2000 (so-called Y-00)-protocol, which can realize a randomized stream cipher with high bit rate (Gbit/s) for long distances (several hundreds km). The randomized stream cipher with randomization by quantum noise based on the Y-00 protocol is called a quantum stream cipher in this paper, and it may have security against known plaintext attacks which has no analog with any conventional symmetric key ciphers. We present a simple cryptanalysis based on an attacker's heterodyne measurement and a quantum unambiguous measurement to make clear the strength of the Y-00 protocol in real communication. In addition, we give a design for the implementation of an intensity-modulation scheme and report an experimental demonstration of $1\phantom{\rule{0.3em}{0ex}}\mathrm{Gbit}∕\mathrm{s}$ quantum stream cipher through a $20\text{\ensuremath{-}}\mathrm{km}$-long transmission line.

arXiv:quant-ph/0507043•Physical Review A•Aug 26, 2005•131 citations

Quantum stream cipher beyond the Shannon limit of symmetric key cipher and the possibility of experimental demonstration

Osamu Hirota, Takehisa Iwakoshi, Masaki Sohma +1 more

The security in the next generation optical network which realizes "Cloud Computing System Service with data center" is one of the most important problems. In such a network, the encryption in physical layer which provide super security and small delay is a preferable. It has to be applicable, however, to very high speed data because the basic link is operated at 2.5 Gbit/sec ~ 10 Gbit/sec. The quantum stream cipher by Yuen-2000 protocol (Y00) is a completely new type of random cipher, which can exceed the Shannon limit of the symmetric key cipher. This paper extends some theoretical results on the security for quantum stream cipher such as Y00 protocol and generalized Y00. First, the conditions to exceed the Shannon limit are summarized. We formulate a generalized secret capacity in the sense of wire tap channel supported by secret key to clarify a cipher exceeding the Shannon limit. The generalized secret capacities for space communication and fiber communication based on the generalized Y00 are given. When the relaxation of physical constraint or device limit of the eavesdropper is allowed, we point out that a cipher scheme exceeding the Shannon limit can be realized only by the conventional optical system.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 29, 2010•4 citations

Potentially Information-theoretic Secure Y00 Quantum Stream Cipher with Limited Key Lengths beyond One-Time Pad

Takehisa Iwakoshi

The previous work showed that the Y00 protocol could stay secure with the eavesdropper's guessing probability on the secret keys being strictly less than one under an unlimitedly long known-plaintext attack with quantum memory. However, an assumption that at least a fast correlation attack is completely disabled by irregular mapping. The present study shows that the Y00 protocol can be information-theoretic secure under any quantum-computational crypto-analyses if the Y00 system is well designed. The Y00 protocol directly encrypts messages with short secret keys expanded into pseudo-random running keys unlike One-Time Pad. However, it may offer information-theoretic security beyond the Shannon limit of cryptography.

arXiv:1902.05192•Feb 14, 2019•0 citations
A quantum stream cipher by Yuen 2000 protocol (so-called Y00 protocol or \ensuremathα\ensuremathη\ensuremath{\alpha}\ensuremath{\eta}\ensuremathα\ensuremathη scheme) consisting of linear feedback shift register of short key is very attractive in implementing secure 40 Gbits/s optical data transmission, which is expected as a next-generation network. However, a basic model of the Y00 protocol with a very short key needs a careful design against fast correlation attacks as pointed out by Donnet et al. This Brief Report clarifies an effectiveness of irregular mapping between running key and physical signals in the driver for selection of MMM-ary basis in the transmitter, and gives a design method. Consequently, quantum stream cipher by the Y00 protocol with our mapping has immunity against the proposed fast correlation attacks on a basic model of the Y00 protocol even if the key is very short.
This paper presents the security analysis on the quantum stream cipher so called Yuen-2000 protocol (or αηαηαη scheme) against the fast correlation attack, the typical attack on stream ciphers. Although a very simple experimental model of the quantum stream cipher without a random mapper may be decrypted in the information theoretic sense by the fast correlation algorithm, it is not a basic feature of Yuen 2000 protocol. In fact, we clarify that there exists a randomization scheme which attains the perfect correlation immunity against such attacks under an approximation. And in this scheme, the running key correlation from the second randomization that determines the mapping patterns is dismissed also by quantum noise. In such a case, any fast correlation attack does not work on the quantum stream cipher.
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.
There exists a great gap between one-time pad with perfect secrecy and conventional mathematical encryption. The Yuen 2000 (Y00) protocol or $\ensuremath{\alpha}\ensuremath{\eta}$ scheme may provide a protocol which covers from the conventional security to the ultimate one, depending on implementations. This paper presents the complexity-theoretic security analysis on some models of the Y00 protocol with nonlinear pseudo-random-number-generator and quantum noise diffusion mapping (QDM). Algebraic attacks and fast correlation attacks are applied with a model of the Y00 protocol with nonlinear filtering like the Toyocrypt stream cipher as the running key generator, and it is shown that these attacks in principle do not work on such models even when the mapping between running key and quantum state signal is fixed. In addition, a security property of the Y00 protocol with QDM is clarified. Consequently, we show that the Y00 protocol has a potential which cannot be realized by conventional cryptography and that it goes beyond mathematical encryption with physical encryption.
We investigate the Yuen 2000 (so-called Y-00)-protocol, which can realize a randomized stream cipher with high bit rate (Gbit/s) for long distances (several hundreds km). The randomized stream cipher with randomization by quantum noise based on the Y-00 protocol is called a quantum stream cipher in this paper, and it may have security against known plaintext attacks which has no analog with any conventional symmetric key ciphers. We present a simple cryptanalysis based on an attacker's heterodyne measurement and a quantum unambiguous measurement to make clear the strength of the Y-00 protocol in real communication. In addition, we give a design for the implementation of an intensity-modulation scheme and report an experimental demonstration of 1Gbit∕s1\phantom{\rule{0.3em}{0ex}}\mathrm{Gbit}∕\mathrm{s}1Gbit∕s quantum stream cipher through a $20\text{\ensuremath{-}}\mathrm{km}$-long transmission line.
The security in the next generation optical network which realizes "Cloud Computing System Service with data center" is one of the most important problems. In such a network, the encryption in physical layer which provide super security and small delay is a preferable. It has to be applicable, however, to very high speed data because the basic link is operated at 2.5 Gbit/sec ~ 10 Gbit/sec. The quantum stream cipher by Yuen-2000 protocol (Y00) is a completely new type of random cipher, which can exceed the Shannon limit of the symmetric key cipher. This paper extends some theoretical results on the security for quantum stream cipher such as Y00 protocol and generalized Y00. First, the conditions to exceed the Shannon limit are summarized. We formulate a generalized secret capacity in the sense of wire tap channel supported by secret key to clarify a cipher exceeding the Shannon limit. The generalized secret capacities for space communication and fiber communication based on the generalized Y00 are given. When the relaxation of physical constraint or device limit of the eavesdropper is allowed, we point out that a cipher scheme exceeding the Shannon limit can be realized only by the conventional optical system.
The previous work showed that the Y00 protocol could stay secure with the eavesdropper's guessing probability on the secret keys being strictly less than one under an unlimitedly long known-plaintext attack with quantum memory. However, an assumption that at least a fast correlation attack is completely disabled by irregular mapping. The present study shows that the Y00 protocol can be information-theoretic secure under any quantum-computational crypto-analyses if the Y00 system is well designed. The Y00 protocol directly encrypts messages with short secret keys expanded into pseudo-random running keys unlike One-Time Pad. However, it may offer information-theoretic security beyond the Shannon limit of cryptography.