Non breakable data encryption with classical information? Conference Paper

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. 2005 American Institute of Physics.

name of conference

• UNSOLVED PROBLEMS OF NOISE AND FLUCTUATIONS: UPoN 2005: Fourth International Conference on Unsolved Problems of Noise and Fluctuations in Physics, Biology, and High Technology

authors

• Kish, Laszlo

published proceedings

• Unsolved Problems of Noise and Fluctuations

author list (cited authors)

• Kish, L. B., Sethuraman, S., & Heszler, P.

citation count

• 0

complete list of authors

• Kish, LB||Sethuraman, S||Heszler, P

publication date

• January 2005

publisher

• AIP  Publisher

published in

• AIP Conference Proceedings  Journal

keywords

• Classical Communication
• Data Security
• Quantum Corrununication
• Secure Encryption

Digital Object Identifier (DOI)

• 10.1063/1.2138613

International Standard Book Number (ISBN) 10

• 0-7354-0289-2

International Standard Book Number (ISBN) 13

• 9780735402898

start page

• 193

end page

• 196

volume

• 800

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1063%2F1.2138613