Non Breakable Data Encryption With Classical Information? Conference Paper uri icon

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.

author list (cited authors)

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

publication date

  • January 1, 2005 11:11 AM

publisher

  • AIP  Publisher