Admin: Created page with "In cryptography, the '''Rip van Winkle cipher''' is a provably secure cipher with a finite key, assuming the attacker has..."

2019-07-05T08:37:22Z

Created page with "In cryptography, the '''Rip van Winkle cipher''' is a provably secure cipher with a finite key, assuming the attacker has..."

New page

In [[cryptography]], the '''Rip van Winkle cipher''' is a [[Provable security|provably secure]] [[cipher]] with a finite [[key (cryptography)|key]], assuming the attacker has only finite storage.

The cipher requires a broadcaster (perhaps a [[numbers station]]) publicly transmitting a series of random numbers.

The sender encrypts a plaintext message by XORing it with the random numbers, then holding it some length of time T.
At the end of that time, the sender finally transmits the encrypted message.

The receiver holds the random numbers the same length of time T.
As soon as the receiver gets the encrypted message, he XORs it with the random numbers he remembers were transmitted T ago, to recover the original plaintext message.

The delay T represents the "key" and must be securely communicated only once.

Ueli Maurer says the original Rip van Winkle cipher is completely impractical, but it motivated a new approach to provable security.

==Sources==
<references />
J.L. Massey and I. Ingemarsson. ''The Rip van Winkle cipher - a simple and provably computationally secure cipher with a finite key.'' In Proc. [[Institute of Electrical and Electronics Engineers|IEEE]] Int. Symp. Information Theory (Abstracts), page 146, 1985.

==Source==

[http://wikipedia.org/ http://wikipedia.org/]
==See Also on BitcoinWiki==
* [[April 2013 bubble]]

Rip van Winkle cipher - Revision history

Admin: Created page with "In cryptography, the '''Rip van Winkle cipher''' is a provably secure cipher with a finite key, assuming the attacker has..."