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:0704.1484

One-time pad booster for Internet

Geraldo A. Barbosa

Published Apr 11, 2007• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.0704.1484

Related papers

Secure sharing of random bits over the Internet

Geraldo A. Barbosa

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.

arXiv:0705.2243•May 15, 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

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 SECURE KEY DISTRIBUTION SYSTEM WITH NO COURIERS: A ONE-TIME-PAD REVIVAL

Geraldo A. Barbosa

Among the problems to guarantee secrecy for in-transit information, the difficulties involved in renewing cryptographic keys in a secure way using couriers, the perfect secrecy encryption method known as One-Time-Pad (OTP) became almost obsolete. Pure quantum key distribution (QKD) ideally offers security for key distribution and could revive OTP. However, special networks that may need optical fibers, satellite, relay stations, expensive detection equipment compared with telecom technology and the slow protocol offer powerful obstacles for widespread use of QKD. Classical encryption methods flood the secure communication landscape. Many of them rely its security on historical difficulties such as factoring of large numbers - their alleged security sometimes are presented as the difficulty to brake encryption by brute force. The possibility for a mathematical breakthrough that could make factoring trivial are poorly discussed. This work proposes a solution to bring perfect secrecy to in-transit communication and without the above problems. It shows the key distribution scheme (nicknamed KeyBITS Platform) based on classical signals carrying information but that carry with them recordings of quantum noise. Legitimate users start with a shared information of the coding bases used that gives them an information advantage that allows easy signal recovery. The recorded noise protects the legitimate users and block the attacker's access. This shared information is refreshed at the end of each batch of keys sent providing the secret shared information for the next round. With encryption keys distilled from securely transmitted signals at each round OTP can be revived and at fast speeds.

arXiv:1901.05324•Journal of Information Security and Cryptography (Enigma)•Jan 27, 2019•0 citations

Self-Renewing One-Time Pad: Information-Theoretic Messaging Beyond Initial Pad Exhaustion

AriaLabs Systems LLC

The classical limitation of one-time-pad (OTP) cryptography is the key-distribution problem: to send n bits of plaintext, the parties must already share n bits of pre-distributed key. Once the pad is exhausted, the parties must meet again to exchange new pad material. This is widely viewed as making pure OTP impractical for sustained communication. We present a protocol that resolves this limitation: once an initial pad of size N is shared in person, subsequent pad material is generated by one party from a true-random source and transmitted as encrypted payload over the existing OTP channel itself. The receiver decrypts using existing pad and appends the recovered random bytes to its local pad. Net pad balance after a refill operation is unchanged — bytes of old pad are spent to deliver an equal number of bytes of new pad — but the new material is fresh, secret, and uncompromised. We prove inductively that information-theoretic security of the new pad is preserved across arbitrary refill chains. The result is a protocol with all the security guarantees of classical OTP and none of its practical key-distribution limitation, given a single in-person bootstrap.

•May 5, 2026•5 citations
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.
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.
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.
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.
Among the problems to guarantee secrecy for in-transit information, the difficulties involved in renewing cryptographic keys in a secure way using couriers, the perfect secrecy encryption method known as One-Time-Pad (OTP) became almost obsolete. Pure quantum key distribution (QKD) ideally offers security for key distribution and could revive OTP. However, special networks that may need optical fibers, satellite, relay stations, expensive detection equipment compared with telecom technology and the slow protocol offer powerful obstacles for widespread use of QKD. Classical encryption methods flood the secure communication landscape. Many of them rely its security on historical difficulties such as factoring of large numbers - their alleged security sometimes are presented as the difficulty to brake encryption by brute force. The possibility for a mathematical breakthrough that could make factoring trivial are poorly discussed. This work proposes a solution to bring perfect secrecy to in-transit communication and without the above problems. It shows the key distribution scheme (nicknamed KeyBITS Platform) based on classical signals carrying information but that carry with them recordings of quantum noise. Legitimate users start with a shared information of the coding bases used that gives them an information advantage that allows easy signal recovery. The recorded noise protects the legitimate users and block the attacker's access. This shared information is refreshed at the end of each batch of keys sent providing the secret shared information for the next round. With encryption keys distilled from securely transmitted signals at each round OTP can be revived and at fast speeds.
The classical limitation of one-time-pad (OTP) cryptography is the key-distribution problem: to send n bits of plaintext, the parties must already share n bits of pre-distributed key. Once the pad is exhausted, the parties must meet again to exchange new pad material. This is widely viewed as making pure OTP impractical for sustained communication. We present a protocol that resolves this limitation: once an initial pad of size N is shared in person, subsequent pad material is generated by one party from a true-random source and transmitted as encrypted payload over the existing OTP channel itself. The receiver decrypts using existing pad and appends the recovered random bytes to its local pad. Net pad balance after a refill operation is unchanged — bytes of old pad are spent to deliver an equal number of bytes of new pad — but the new material is fresh, secret, and uncompromised. We prove inductively that information-theoretic security of the new pad is preserved across arbitrary refill chains. The result is a protocol with all the security guarantees of classical OTP and none of its practical key-distribution limitation, given a single in-person bootstrap.