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

arXiv:0705.2243

Secure sharing of random bits over the Internet

Geraldo A. Barbosa

Published May 15, 2007• 0 citations
arXivHTMLPDF

Abstract

Although one-time pad encrypted files can be sent through Internet channels, the need for renewing shared secret keys have made this method unpractical. This work presents a scheme to turn practical the fast sharing of random keys over arbitrary Internet channels. Starting with a shared secret key sequence of length K_0 the users end up with a secure new sequence K >> K_0. Using these sequences for posteriori message encryption the legitimate users have absolute security control without the need for third parties. Additionally, the security level does not depend on the unproven difficulty of factoring numbers in primes. In the proposed scheme a fast optical random source generates random bits and noise for key renewals. The transmitted signals are recorded signals that carries both the random binary signals to be exchanged and physical noise that cannot be eliminated by the attacker. These signals allow amplification over the Internet network without degrading security. The proposed system is also secure against a-posteriori known-plaintext attack on the key. Information-theoretic analysis is presented and bounds for secure operation are quantitatively determined.

DOI
10.48550/arxiv.0705.2243

Related papers

One-time pad booster for Internet

Geraldo A. Barbosa

One-time pad encrypted files can be sent through Internet channels using current Internet protocols. However, the need for renewing shared secret keys make this method unpractical. This work shows how users can use a fast physical random generator based on fluctuations of a light field and the Internet channel to directly boost key renewals. The transmitted signals are deterministic but carries imprinted noise that cannot be eliminated by the attacker. Thus, a one-time pad for Internet can be made practical. Security is achieved without third parties and not relying on the difficulty of factoring numbers in primes. An informational fragility to be avoided is discussed. Information-theoretic analysis is presented and bounds for secure operation are determined.

arXiv:0704.1484•Apr 11, 2007•0 citations

Fundamentals for immediate implementation of a quantum secured Internet

Geraldo A. Barbosa

This work shows how a secure Internet for users A and B can be implemented through a fast key distribution system that uses physical noise to encrypt information transmitted in deterministic form. Starting from a shared secret random sequence between them, long sequences of fresh random bits can be shared in a secure way and not involving a third party. The shared decrypted random bits -encrypted by noise at the source- are subsequently utilized for one-time-pad data encryption. The physical generated protection is not susceptible to advances in computation or mathematics. In particular, it does not depend on the difficulty of factoring numbers in primes. Also, there is no use of Linear Feed Back Shift Registers. The attacker has free access to the communication channels and may acquire arbitrary number of copies of the transmitted signal without lowering the security level. No intrusion detection method is needed.

arXiv:quant-ph/0607093•Jul 14, 2006•0 citations

Noise Secured Internet

Geraldo A. Barbosa

This work shows how a secure Internet can be implemented through a fast key distribution system that uses physical noise to protect the transmitted information. Starting from a shared random sequence $K_0$ between two (or more) users, longsequences $R$ of random bits can be shared. The signals sent over the Internet are deterministic but have a built-in Nature-made uncertainty that protects the shared sequences. After privacy amplification the shared $R$ random bits --encrypted by noise-- are subsequently utilized in one-time-pad data ciphering.

arXiv:quant-ph/0510011•Oct 3, 2005•1 citation

Fast and secure key distribution using mesoscopic coherent states of light

Geraldo A. Barbosa

This work shows how two parties A and B can securely share unlimited sequences of random bits at optical speeds. A and B possess true-random physical sources and exchange random bits by using a random sequence received to cipher the following one to be sent. A starting shared secret key is used and the method can be described as a one-time-pad unlimited extender. It is demonstrated that the minimum probability of error in signal determination by the eavesdropper can be set arbitrarily close to the pure guessing level. Being based on the M-ry encryption protocol this method also allows for optical amplification without security degradation, offering practical advantages over the Bennett-Brassard 1984 protocol for key distribution.

arXiv:quant-ph/0212033•Physical Review A•Nov 4, 2003•23 citations

Untappable Key Distribution System: a One-Time-Pad Booster

Geraldo A. Barbosa, Jeroen van de Graaf

The One-Time-Pad (OTP) protocol gives unconditional security for the information being encrypted. Correctly implemented, not even an adversary with a quantum computer can crack it. However, the need of sharing in a secure way supplies of symmetric random keys turned the method almost obsolete as a stand-alone method for fast and large volume telecommunication. Basically, this secure sharing of keys and their renewal, once exhausted, had to be done through couriers, in a slow and costly process. This paper presents a solution for this problem providing a fast and unlimited renewal of secure keys: An untappable key distribution system is presented and detailed. This fast key distribution system utilizes two layers of confidentially protection: 1) Physical noise intrinsic to the optical channel that turn the coded signals into stealth signals and 2) Privacy amplification using a bit pool of refreshed entropy run after run, to eliminate any residual information. The resulting level of security is rigorously calculated and demonstrates that the level of information an eavesdropper could obtain is negligible. The random bit sequences, fast and securely distributed, can be used to encrypt text, data or voice.

arXiv:1406.1543•Journal of Information Security and Cryptography (Enigma)•May 4, 2016•4 citations

A Wireless Physically Secure Key Distribution System

Geraldo A. Barbosa

A fast and secure key distribution system is shown that operates in classical channels but with a dynamic protection given by the shot noise of light. The binary signals in the communication channel are protected by coding in random bases and by addition of physical noise that was recorded and added bit by bit to the signals. While the resulting signals are classical they carry the uncontrollable randomness information in the signal sent. The legitimate users start with a shared secret between them creating a measuring advantage over the adversary. This way the introduced noise does not affect the users but frustrates the attacker.

arXiv:1601.00082•Journal of Information Security and Cryptography (Enigma)•Sep 3, 2016•0 citations
Although one-time pad encrypted files can be sent through Internet channels, the need for renewing shared secret keys have made this method unpractical. This work presents a scheme to turn practical the fast sharing of random keys over arbitrary Internet channels. Starting with a shared secret key sequence of length K_0 the users end up with a secure new sequence K >> K_0. Using these sequences for posteriori message encryption the legitimate users have absolute security control without the need for third parties. Additionally, the security level does not depend on the unproven difficulty of factoring numbers in primes. In the proposed scheme a fast optical random source generates random bits and noise for key renewals. The transmitted signals are recorded signals that carries both the random binary signals to be exchanged and physical noise that cannot be eliminated by the attacker. These signals allow amplification over the Internet network without degrading security. The proposed system is also secure against a-posteriori known-plaintext attack on the key. Information-theoretic analysis is presented and bounds for secure operation are quantitatively determined.
One-time pad encrypted files can be sent through Internet channels using current Internet protocols. However, the need for renewing shared secret keys make this method unpractical. This work shows how users can use a fast physical random generator based on fluctuations of a light field and the Internet channel to directly boost key renewals. The transmitted signals are deterministic but carries imprinted noise that cannot be eliminated by the attacker. Thus, a one-time pad for Internet can be made practical. Security is achieved without third parties and not relying on the difficulty of factoring numbers in primes. An informational fragility to be avoided is discussed. Information-theoretic analysis is presented and bounds for secure operation are determined.
This work shows how a secure Internet for users A and B can be implemented through a fast key distribution system that uses physical noise to encrypt information transmitted in deterministic form. Starting from a shared secret random sequence between them, long sequences of fresh random bits can be shared in a secure way and not involving a third party. The shared decrypted random bits -encrypted by noise at the source- are subsequently utilized for one-time-pad data encryption. The physical generated protection is not susceptible to advances in computation or mathematics. In particular, it does not depend on the difficulty of factoring numbers in primes. Also, there is no use of Linear Feed Back Shift Registers. The attacker has free access to the communication channels and may acquire arbitrary number of copies of the transmitted signal without lowering the security level. No intrusion detection method is needed.
This work shows how a secure Internet can be implemented through a fast key distribution system that uses physical noise to protect the transmitted information. Starting from a shared random sequence K0K_0K0​ between two (or more) users, longsequences RRR of random bits can be shared. The signals sent over the Internet are deterministic but have a built-in Nature-made uncertainty that protects the shared sequences. After privacy amplification the shared RRR random bits --encrypted by noise-- are subsequently utilized in one-time-pad data ciphering.
This work shows how two parties A and B can securely share unlimited sequences of random bits at optical speeds. A and B possess true-random physical sources and exchange random bits by using a random sequence received to cipher the following one to be sent. A starting shared secret key is used and the method can be described as a one-time-pad unlimited extender. It is demonstrated that the minimum probability of error in signal determination by the eavesdropper can be set arbitrarily close to the pure guessing level. Being based on the M-ry encryption protocol this method also allows for optical amplification without security degradation, offering practical advantages over the Bennett-Brassard 1984 protocol for key distribution.
The One-Time-Pad (OTP) protocol gives unconditional security for the information being encrypted. Correctly implemented, not even an adversary with a quantum computer can crack it. However, the need of sharing in a secure way supplies of symmetric random keys turned the method almost obsolete as a stand-alone method for fast and large volume telecommunication. Basically, this secure sharing of keys and their renewal, once exhausted, had to be done through couriers, in a slow and costly process. This paper presents a solution for this problem providing a fast and unlimited renewal of secure keys: An untappable key distribution system is presented and detailed. This fast key distribution system utilizes two layers of confidentially protection: 1) Physical noise intrinsic to the optical channel that turn the coded signals into stealth signals and 2) Privacy amplification using a bit pool of refreshed entropy run after run, to eliminate any residual information. The resulting level of security is rigorously calculated and demonstrates that the level of information an eavesdropper could obtain is negligible. The random bit sequences, fast and securely distributed, can be used to encrypt text, data or voice.
A fast and secure key distribution system is shown that operates in classical channels but with a dynamic protection given by the shot noise of light. The binary signals in the communication channel are protected by coding in random bases and by addition of physical noise that was recorded and added bit by bit to the signals. While the resulting signals are classical they carry the uncontrollable randomness information in the signal sent. The legitimate users start with a shared secret between them creating a measuring advantage over the adversary. This way the introduced noise does not affect the users but frustrates the attacker.