AIP conference proceedings

Non Breakable Data Encryption With Classical Information?

László B. Kish

Published Jan 1, 2005• 2 citations

Abstract

With the Kish‐Sethuraman (KS) cipher an attempt was made, by using special operators and communication, to reach absolutely secure classical communication. First the message is bounced back with additional encryption by the Receiver and then the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. Klappenecker has pointed out that finding an efficient software realization of the operators is equivalent of proving the P ≠ NP problem. Various open problems are discussed.

DOI: 10.1063/1.2138613

Related papers

The double-padlock problem: Is secure classical information transmission possible without key exchange?

James M. Chappell, Lachlan J. Gunn, Derek Abbott

The idealized Kish-Sethuraman (KS) cipher is theoretically known to offer perfect security through a classical information channel. However, realization of the protocol is hitherto an open problem, as the required mathematical operators have not been identified in the previous literature. A mechanical analogy of this protocol can be seen as sending a message in a box using two padlocks; one locked by the Sender and the other locked by the Receiver, so that theoretically the message remains secure at all times. We seek a mathematical representation of this process, considering that it would be very unusual if there was a physical process with no mathematical description. We select Clifford's geometric algebra for this task as it is a natural formalism to handle rotations in spaces of various dimension. The significance of finding a mathematical description that describes the protocol, is that it is a possible step toward a physical realization having benefits in increased security with reduced complexity.

arXiv:1212.3017International Journal of Modern Physics Conference SeriesJan 1, 20141 citation

An absolutely secure QKD scheme with no detection noise, entanglement and classical communication

János A. Bergou, László B. Kish

A new quantum communication scheme is introduced which is the quantum realization of the classical Kish-Sethuraman (KS) cipher. First the message is bounced back with additional encryption by the Receiver and the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. We show that the rotation of the polarization is an operator which satisfies the conditions required for the KS encryption operators provided single photons are communicated. The new method is not only simple but has several advantages. The Evasdropper extracts zero information even if she executes a quantum measurement on the state. The communication can be done by two publicly agreed orthogonal states. Therefore, there is no inherent detection noise. No classical channel and no entangled states are required for the communication.

arXiv:quant-ph/0509097Sep 14, 20051 citation

Physical-layer encryption on the public internet: A stochastic approach to the Kish-Sethuraman cipher

Lachlan J. Gunn, James M. Chappell, Andrew Allison +1 more

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.

arXiv:1306.4174International Journal of Modern Physics Conference SeriesJan 1, 20142 citations

Enhanced Usage of Keys Obtained by Physical, Unconditionally Secure Distributions

Laszlo B. Kish, Claes-Göran Granqvist

Unconditionally secure physical key distribution schemes are very slow, and it is practically impossible to use a one-time-pad based cipher to guarantee unconditional security for the encryption of data because using the key bits more than once gives out statistical information, for example via the known-plain-text-attack or by utilizing known components of the protocol and language statistics. Here, we outline a protocol that reduces this speed problem and allows almost-one-time-pad based communication with an unconditionally secure physical key of finite length. The physical, unconditionally secure key is not used for data encryption but is employed in order to generate and share a new software-based key without any known-plain-text component. The software-only-based key distribution is then changed from computationally secure to unconditionally secure, because the communicated key-exchange data (algorithm parameters, one-way functions of random numbers, etc.) are encrypted in an unconditionally secure way with a one-time-pad. For practical applications, this combined physical/software key distribution based communication looks favorable compared to the software-only and physical-only key distribution based communication whenever the speed of the physical key distribution is much lower than that of the software-based key distribution. A mathematical security proof of this new scheme remains an open problem.

arXiv:1408.5800Fluctuation and Noise LettersMay 4, 201524 citations

Adaptively-Secure, Non-Interactive Public-Key Encryption.

Ran Canetti, Shai Halevi, Jonathan I. Katz

Abstract. Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitrarily-many messages to a given receiver who maintains only a single short decryption key. However, it is known that these requirements are impossible to achieve: no non-interactive encryption scheme that supports encryption of an unbounded number of messages and uses a single, unchanging decryption key can be adaptively secure. Impossibility holds even if secure data erasure is possible. We show that this limitation can be overcome by updating the decryption key over time and making some mild assumptions about the frequency of communication between parties. Using this approach, we construct adaptively-secure, completely non-interactive encryption schemes supporting secure encryption of arbitrarily-many messages from arbitrarilymany senders. Our schemes additionally provide forward security and security against chosen-ciphertext attacks. 1

Jan 1, 20041 citation

RESPONSE TO KLAPPENECKER'S REMARK ON A NON-BREAKABLE DATA ENCRYPTION SCHEME BY KISH AND SETHURAMAN

László B. Kish

Some additional comments on Klappenecker's remarks are presented. In the original paper the possibility of man-in-the-middle attack was not considered. A simple method is shown which safely protects against this attack. Finally, a special case is shown where this encryption method is more advantageous than quantum encryption.

Fluctuation and Noise LettersDec 1, 20042 citations