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

International Journal of Computer Applications

A New Trend of Pseudo Random Number Generation using QKD

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty, Abdel-Badeeh Mohamed Salem

Published Jun 18, 2014• 4 citations
Publisher

Abstract

Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys.This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation.The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties.

DOI
10.5120/16773-6344

Related papers

A New Trend of Pseudo Random Number Generation using QKD

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty +1 more

Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation. The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties

arXiv:1411.2469•Oct 2, 2014•4 citations

Statistical analysis for random bits generation on quantum key distribution

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty +1 more

Recently, Quantum cryptography researchers utilize the quantum keys, in order to provide a more trusted environment for both key distribution and management processes. The quantum keys are generated based on quantum mechanics phenomena. However, all events for the quantum key generation rely on exchanging photons between parties over limited distances. So, in this paper, random tests algorithms, such as NIST and DIEHARD, are implemented to test and evaluate the randomness rates for quantum keys generation. After then, the initialized vector, which is the seed of the symmetric encryption algorithms, is established based on specific analysis to be a key for the algorithms. The paper utilizes the (BB84) quantum key distribution (QKD) protocol based on two different innovated modes, the raw and privacy modes.

International Conference on Cyber Security, Cyber Warfare and Digital Forensic (CyberSec)•Apr 1, 2014•7 citations

Quantum Key Distribution: Simulation and Characterizations

Omer K. Jasim Mohammad, Safia Abbas, El-Sayed M. El-Horbaty +1 more

All traditional cryptographic algorithms used in the network communication environments, relied on mathematical models and computational assumptions, are actually unsafe and apt by many attackers (quantum and man-in-the-middle attacks). Therefore, nowadays Quantum Key Distribution (QKD) promises a secure key agreement by using quantum mechanical systems. QKD becomes a significant trend of new cryptographic revolution. This paper explains how cryptography exploits the quantum mechanics in order to achieve an encryption/decryption process. Additionally, this paper provides a standard simulation for QKD-BB84 protocol and describes improvement key generation and key distribution mechanisms. Then, validation, results and efficiency of BB84 protocol are presented using different security configurations. Finally, our results indicated that the QKD is susceptible to corporate with different security applications and achieve the key availability for such applications. However, it suffers from the higher rate of authentication cost.

Procedia Computer Science•Jan 1, 2015•24 citations

Effect of pseudo-random number on the security of quantum key distribution protocol

Xiaoliang Yang, Yu-Qing 毓擎 Li 李, Hong-Wei Li

Abstract In the process of quantum key distribution (QKD), the communicating parties need to randomly determine quantum states and measurement bases. To ensure the security of key distribution, we aim to use true random sequences generated by true random number generators as the source of randomness. In practical systems, due to the difficulty of obtaining true random numbers, pseudo-random number generators are used instead. Although the random numbers generated by pseudo-random number generators are statistically random, meeting the requirements of uniform distribution and independence, they rely on an initial seed to generate corresponding pseudo-random sequences. Attackers may predict future elements from the initial elements of the random sequence, posing a security risk to quantum key distribution. This paper analyzes the problems existing in current pseudo-random number generators and proposes corresponding attack methods and applicable scenarios based on the vulnerabilities in the pseudo-random sequence generation process. Under certain conditions, it is possible to obtain the keys of the communicating parties with very low error rates, thus effectively attacking the quantum key system. This paper presents new requirements for the use of random numbers in quantum key systems, which can effectively guide the security evaluation of quantum key distribution protocols.

Chinese Physics B•Dec 3, 2024•4 citations

Random number generator for cryptography

Ram Soorat, K. Madhuri, Ashok Vudayagiri

One key requirement for many cryptograhic schemes is the generation of random numbers.Sequences of random numbers are used at several stages of a standard cryptographic protocol.One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code.C = M ⊕ K.It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once.The security of a cryptosystem shall not be based on keeping the algorithm secret but solely on keeping the key secret.The security of a random number generator (RNG) is related to the difficulty of predicting its future sequence values from past values.The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques.The generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data.We studied a chaotic circuit which consisted of an inductor, capacitance, diode and thus used for the BB84 protocol.We have studied both pseudo random and true random number generators and evaluated them through various tests like frequency, correlation, NIST etc.

Nanosystems Physics Chemistry Mathematics•Oct 27, 2017•4 citations

Quantum key distribution with a control key

Junaid ur Rehman, Youngmin Jeong, Hyundong Shin

Quantum key distribution (QKD) relies on randomness to exchange secret keys among the communicating parties. While ensuring the secrecy of the keys being distributed, independent randomness also causes to reduce the number of key bits that can be shared per quantum signal exchanged. Recently it was shown that it is possible to use pseudo-randomness in place of true randomness in the QKD without compromising the integrity of a QKD scheme. By the virtue of a short secret key — called a control key — shared among the key sharing parties, same pseudo-randomness can be generated at the transmitter and the receiver end that allow to obtain a higher key exchange rate. However, there are certain modifications which are necessary before pseudo-randomness can be safely employed in a QKD procedure. In this paper, we provide a modification of QKD schemes for a secure use with the control key. We modify the prepare-and-measure (BB84) type, and measurement-device independent protocols. We then verify the advantages of use of control key in terms of key rates for the modification of two QKD schemes.

International Symposium on Wireless Communication Systems•Aug 1, 2017•2 citations
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys.This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation.The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties.
Random Numbers determine the security level of cryptographic applications as they are used to generate padding schemes in the encryption/decryption process as well as used to generate cryptographic keys. This paper utilizes the QKD to generate a random quantum bit rely on BB84 protocol, using the NIST and DIEHARD randomness test algorithms to test and evaluate the randomness rates for key generation. The results show that the bits generated using QKD are truly random, which in turn, overcomes the distance limitation (associated with QKD) issue, its well-known challenges with the sending/ receiving data process between different communication parties
Recently, Quantum cryptography researchers utilize the quantum keys, in order to provide a more trusted environment for both key distribution and management processes. The quantum keys are generated based on quantum mechanics phenomena. However, all events for the quantum key generation rely on exchanging photons between parties over limited distances. So, in this paper, random tests algorithms, such as NIST and DIEHARD, are implemented to test and evaluate the randomness rates for quantum keys generation. After then, the initialized vector, which is the seed of the symmetric encryption algorithms, is established based on specific analysis to be a key for the algorithms. The paper utilizes the (BB84) quantum key distribution (QKD) protocol based on two different innovated modes, the raw and privacy modes.
All traditional cryptographic algorithms used in the network communication environments, relied on mathematical models and computational assumptions, are actually unsafe and apt by many attackers (quantum and man-in-the-middle attacks). Therefore, nowadays Quantum Key Distribution (QKD) promises a secure key agreement by using quantum mechanical systems. QKD becomes a significant trend of new cryptographic revolution. This paper explains how cryptography exploits the quantum mechanics in order to achieve an encryption/decryption process. Additionally, this paper provides a standard simulation for QKD-BB84 protocol and describes improvement key generation and key distribution mechanisms. Then, validation, results and efficiency of BB84 protocol are presented using different security configurations. Finally, our results indicated that the QKD is susceptible to corporate with different security applications and achieve the key availability for such applications. However, it suffers from the higher rate of authentication cost.
Abstract In the process of quantum key distribution (QKD), the communicating parties need to randomly determine quantum states and measurement bases. To ensure the security of key distribution, we aim to use true random sequences generated by true random number generators as the source of randomness. In practical systems, due to the difficulty of obtaining true random numbers, pseudo-random number generators are used instead. Although the random numbers generated by pseudo-random number generators are statistically random, meeting the requirements of uniform distribution and independence, they rely on an initial seed to generate corresponding pseudo-random sequences. Attackers may predict future elements from the initial elements of the random sequence, posing a security risk to quantum key distribution. This paper analyzes the problems existing in current pseudo-random number generators and proposes corresponding attack methods and applicable scenarios based on the vulnerabilities in the pseudo-random sequence generation process. Under certain conditions, it is possible to obtain the keys of the communicating parties with very low error rates, thus effectively attacking the quantum key system. This paper presents new requirements for the use of random numbers in quantum key systems, which can effectively guide the security evaluation of quantum key distribution protocols.
One key requirement for many cryptograhic schemes is the generation of random numbers.Sequences of random numbers are used at several stages of a standard cryptographic protocol.One simple example is a Vernam cipher, where a string of random numbers is added to message string to generate encrypted code.C = M ⊕ K.It has been mathematically shown that this simple scheme is unbreakable if key K is as long as M and is used only once.The security of a cryptosystem shall not be based on keeping the algorithm secret but solely on keeping the key secret.The security of a random number generator (RNG) is related to the difficulty of predicting its future sequence values from past values.The quality and unpredictability of secret data is critical to securing communication by modern cryptographic techniques.The generation of such data for cryptographic purposes typically requires an unpredictable physical source of random data.We studied a chaotic circuit which consisted of an inductor, capacitance, diode and thus used for the BB84 protocol.We have studied both pseudo random and true random number generators and evaluated them through various tests like frequency, correlation, NIST etc.
Quantum key distribution (QKD) relies on randomness to exchange secret keys among the communicating parties. While ensuring the secrecy of the keys being distributed, independent randomness also causes to reduce the number of key bits that can be shared per quantum signal exchanged. Recently it was shown that it is possible to use pseudo-randomness in place of true randomness in the QKD without compromising the integrity of a QKD scheme. By the virtue of a short secret key — called a control key — shared among the key sharing parties, same pseudo-randomness can be generated at the transmitter and the receiver end that allow to obtain a higher key exchange rate. However, there are certain modifications which are necessary before pseudo-randomness can be safely employed in a QKD procedure. In this paper, we provide a modification of QKD schemes for a secure use with the control key. We modify the prepare-and-measure (BB84) type, and measurement-device independent protocols. We then verify the advantages of use of control key in terms of key rates for the modification of two QKD schemes.