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.
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 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 new digital key distribution and encryption system for broad use is presented. It offers affordable perfect security for in-transit digital communications and is quantum-resistant. It uses true random bits generated from vacuum quantum fluctuations in an optical electromagnetic field to protect the bit (key) distribution. This distribution process uses recorded quantum noise and works in any channel or combination of channels. The quantum noise, independently, creates truly random bits and cloaks the transmitted signals. The default encryption, with distilled keys from these transmitted bits, is an automated one-time-pad, with no need for couriers to replenish keys. The level of security is calculated. The coexistence of encryption and quantum computers raises multi-disciplinary problems, theoretical and practical. Challenges exist now, because “harvest now, decrypt later” is increasingly practiced. An answer for a quantum resistant key distribution is Quantum Key Distribution (QKD). It is purely quantum and offers unconditional security. However, many practical and technological aspects plague QKD: it is slow, distance limited, needs quantum channels and is very costly - not for broad commercial use. NIST is starting to offer encryption solutions believed to be quantum-resistant. They are based on deterministic computational complexities. Differently, the security of our solution rests primarily on non-deterministic features.
Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.
In this thesis, a new practical method to realize one-time pad perfect secrecy for wireless \ncommunication is presented. Most commonly used security methods are based on cryp- tographic \ntechniques employed at the upper layers of a wireless network. These methods basically rely on the \ncomputational hardness of some mathematical problems. This com- putational complexity is vulnerable \nin nature due to fast-growing computational power of hardware technology, yet not taking into \naccount the revolution of Quantum computing in further future. Another core problematic issue \nexists in symmetric security systems; there is a deadlock between securing the channel and \nestablishing the shared key. We need the key for securing the channel, on the other hand, for \nsharing the key we need a secure channel. \n \nTo address such vulnerabilities, Physical Layer Security (PLS) has been widely studied in recent \nyears. PLS schemes build on the idea of turning unpredictable and random wire- less channel \ncharacteristics into a source for information-theoretic security. Information- theoretic security \nitself, relies on Shannon’s pioneer work . Shannon, inspired by one-time pad, also known as Vernam \ncipher, theoretically showed that the only unconditional per- fect secrecy system is a one-time pad \nwith a key at least as random as the plaintext, i.e., a system that uses a different random key to \ncipher any new plaintext. In PLS key genera- tion methods, legitimate parties alternately send \nprobe signals and estimate Channel State Information (CSI) of common random channel and then \nconvert enough amount of these estimates to secure shared keys. To achieve perfect secrecy, the key \ngeneration methods must meet the key randomness and Key Generation Rate (KGR) requirements of \ntheir specific cryptographic applications. \n \nIn this research a new practical system for achieving unconditional perfect secrecy is presented. \nOur system uses channel phase as the probing parameter to fully benefit from its uniform \ndistribution over [0, 2π]. It also uses an encryption method based on modulo- \n2π addition of phase values which is the perfect counterpart of XOR addition in binary one-time \npad. Moreover, by intentionally perturbing the wireless channel in vicinity of the transceiver \nantenna based on RF-mirrors structure, it produces different random phase values in each channel \nprobing, much faster than the inherent channel variation would do, resulting in dramatically higher \nKGR than any wide-band PLS scheme presented so far and realizing true perfect secrecy. Most \nimportantly, the focus of this research is a detailed practical algorithm for implementing the \nsystem as well as empirical results which makes \nour system the first channel-phase-based PLS scheme implementation, reported so far.
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 paper proposes a new data transmission technique that uses Quantum Key Distribution (QKD) method, One Time Pad (OTP) encryption technique and Huffman encoding compression algorithm to transmit the data more securely and efficiently. While data is transmitted, requirements like secrecy, less overhead through compression etc are crucial issues. QKD is one of the most promising methods which provide unconditional security. It relies upon the immutable laws of quantum physics rather than computational complexity as the basis of its secrecy. To establish the trust between the sender and the receiver, this paper considers a trusted center that distributes and verifies the key. Also it uses Huffman encoding-a lossless compression algorithm to compress the transmitted data over the classical channel that reduces the data transmission overhead. Moreover for data encryption, it applies OTP technique with the key randomly generated by the QKD method that ensures the secrecy of the transmitted data over the classical channel. Thus the overhead of both quantum and classical channels are reduced. Finally the time requirements for encoding-decoding and encryption-decryption for the proposed technique are evaluated.