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

Unbreakable code – the keys to your secrets in quantum states of light

Romain Alléaume

Published Mar 1, 2015• 0 citations
OpenAlex

Related papers

KEY DISTRIBUTION VERSUS KEY ENHANCEMENT IN QUANTUM CRYPTOGRAPHY

Naya Nagy, Marius Nagy, Selim G. Akl

It has been said that quantum cryptography in general offers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum protocols to establish a new large secret key. This large secret key can be arbitrarily long and is unbreakable. Thus, to date, the main contribution of quantum cryptography has been believed to be quantum key enhancement. This paper shows that quantum cryptography can do significantly more. The quantum protocol described here distributes an unbreakable secret key to the two parties by relying on public information only. This is the first time that quantum cryptography is shown to be able to produce secret information using only public information. This contribution is also unique for cryptography in general, classical and quantum.

Parallel Processing Letters•Sep 1, 2010•8 citations

The Keys to Quantum Secrets

Colin P. Williams, Scott H. Clearwater

Springer eBooks•Jan 1, 2000•0 citations

Quantum States of Light

Akira Furusawa

SpringerBriefs in mathematical physics•Jan 1, 2015•18 citations

Quantum Cryptography

Ahmed Banafa

Quantum cryptography uses physics to develop a cryptosystem completely secure against being compromised, without the sender or the receiver of messages being known. The word quantum itself refers to the most fundamental behavior of the smallest particles of matter and energy. Quantum cryptography is different from traditional cryptographic systems in that it relies more on physics, rather than mathematics, as a key aspect of its security model. Essentially, quantum cryptography is based on the usage of individual particles/waves of light (photon) and their intrinsic quantum properties to develop an unbreakable cryptosystem (because it is impossible to measure the quantum state of any system without disturbing that system). Regular, non-quantum encryption can work in a variety of ways but generally a message is scrambled and can only be unscrambled using a secret key. The trick is to make sure that whomever you’re trying to hide your communication from doesn’t get their hands on your secret key.

River Publishers eBooks•Jul 13, 2023•0 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•7 citations

Quantum light: unlocking the invisible and transforming the possible

Manijeh Razeghi

Journal of the Franklin Institute•Aug 18, 2026•0 citations
It has been said that quantum cryptography in general offers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum protocols to establish a new large secret key. This large secret key can be arbitrarily long and is unbreakable. Thus, to date, the main contribution of quantum cryptography has been believed to be quantum key enhancement. This paper shows that quantum cryptography can do significantly more. The quantum protocol described here distributes an unbreakable secret key to the two parties by relying on public information only. This is the first time that quantum cryptography is shown to be able to produce secret information using only public information. This contribution is also unique for cryptography in general, classical and quantum.
Quantum cryptography uses physics to develop a cryptosystem completely secure against being compromised, without the sender or the receiver of messages being known. The word quantum itself refers to the most fundamental behavior of the smallest particles of matter and energy. Quantum cryptography is different from traditional cryptographic systems in that it relies more on physics, rather than mathematics, as a key aspect of its security model. Essentially, quantum cryptography is based on the usage of individual particles/waves of light (photon) and their intrinsic quantum properties to develop an unbreakable cryptosystem (because it is impossible to measure the quantum state of any system without disturbing that system). Regular, non-quantum encryption can work in a variety of ways but generally a message is scrambled and can only be unscrambled using a secret key. The trick is to make sure that whomever you’re trying to hide your communication from doesn’t get their hands on your secret key.
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.