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

Quantum Electronics and Laser Science Conference

Experimental comparison of two methods for quantum cryptography

J. D. Franson, H. Ilves

Published May 2, 1993• 2 citations
OpenAlex

Related papers

Experimental comparison between one-decoy and two-decoy implementations of the Bennett-Brassard 1984 quantum cryptography protocol

Youn-Chang Jeong, Yong‐Su Kim, Yoon-Ho Kim

The decoy-state method allows the use of weak coherent pulses in quantum cryptography, and to date, various strategies for the decoy state have been proposed. Here, we experimentally compare the secret key generation rates between the one-decoy and two-decoy implementations of the Bennett-Brassard 1984 (BB84) quantum key distribution protocol through a 3.1-km optical fiber at 780 nm. Once the parameters of the experimental setup are optimized for the maximal secret key generation rate for each implementation, it is found that the two-decoy implementation outperforms the one-decoy implementation.

Physical Review A•Jan 14, 2016•4 citations

Experimental Quantum Cryptography

Charles H. Bennett, François Bessette, Gilles Brassard +2 more

Lecture notes in computer science•Jan 1, 1991•1,002 citations

Experimental quantum cryptography

Charles H. Bennett, François Bessette, Gilles Brassard +2 more

Journal of Cryptology•Jan 1, 1992•1,716 citations

Studies on the Quality Assessment of PRNG for Q-Trits Quantum Cryptography Protocols

Sergiy O. Gnatyuk, Тетяна Охріменко, Andrii Fesenko +1 more

Cybersecurity contains three basic features such as confidentiality, integrity and availability. Data confidentiality ensuring by encryption has faced quantum computing threat, but this problem can be solved by using post-quantum cryptography and / or quantum cryptography (quantum key distribution). For cryptographic applications statistical properties of the generated pseudorandom sequences should not be differ from random sequences. To determine such properties a number of statistical testing methods are used, but they all are focused on the evaluation of binary sequences. In quantum cryptography there are some protocols with Q-trits (qutrits), but these sequences cannot be assessed effectively by binary statistic methods. From this position in the paper quality assessment approach for Q-trits pseudo random number generators and formed sequences was proposed. Also the experimental study of proposed approach (in comparison with NIST STS) was carried out. Given results show that NIST STS technique cannot be used to evaluate the quality of the Q-trit sequences and generators, but developed method is suitable to use in practice for evaluating Q-trit sequences (generators) quality.

International Scientific-Practical Conference Problems of Infocommunications Science and Technology•Oct 5, 2021•1 citation

Towards practical quantum cryptography

Surasak Chiangga, Patrick Zarda, Thomas D. Jennewein +1 more

Applied Physics B•Dec 1, 1999•13 citations

Comparative analysis of existing key exchange protocols for symmetric cryptosystems

Яна Николаевна Крохалева, Elena Krotova

This article is devoted to the current problem - the distribution of keys in cryptographic systems. In the work, two basic methods of key distribution, which are currently used in the designof cryptographic systems, are examined and compared in detail. The Diffie-Hellman algorithmis the primary key distribution method in existing protocols for automated distributed systems.The technologies of quantum cryptography are getting more and more development and require analysis and comparison with other methods of classical cryptography regarding competitiveness.

Journal of the Ural Federal district Information security•Jan 1, 2019•0 citations
The decoy-state method allows the use of weak coherent pulses in quantum cryptography, and to date, various strategies for the decoy state have been proposed. Here, we experimentally compare the secret key generation rates between the one-decoy and two-decoy implementations of the Bennett-Brassard 1984 (BB84) quantum key distribution protocol through a 3.1-km optical fiber at 780 nm. Once the parameters of the experimental setup are optimized for the maximal secret key generation rate for each implementation, it is found that the two-decoy implementation outperforms the one-decoy implementation.
Cybersecurity contains three basic features such as confidentiality, integrity and availability. Data confidentiality ensuring by encryption has faced quantum computing threat, but this problem can be solved by using post-quantum cryptography and / or quantum cryptography (quantum key distribution). For cryptographic applications statistical properties of the generated pseudorandom sequences should not be differ from random sequences. To determine such properties a number of statistical testing methods are used, but they all are focused on the evaluation of binary sequences. In quantum cryptography there are some protocols with Q-trits (qutrits), but these sequences cannot be assessed effectively by binary statistic methods. From this position in the paper quality assessment approach for Q-trits pseudo random number generators and formed sequences was proposed. Also the experimental study of proposed approach (in comparison with NIST STS) was carried out. Given results show that NIST STS technique cannot be used to evaluate the quality of the Q-trit sequences and generators, but developed method is suitable to use in practice for evaluating Q-trit sequences (generators) quality.
This article is devoted to the current problem - the distribution of keys in cryptographic systems. In the work, two basic methods of key distribution, which are currently used in the designof cryptographic systems, are examined and compared in detail. The Diffie-Hellman algorithmis the primary key distribution method in existing protocols for automated distributed systems.The technologies of quantum cryptography are getting more and more development and require analysis and comparison with other methods of classical cryptography regarding competitiveness.