ONE-TIME PAD CRYPTOGRAPHY

Frank Rubin · Cryptologia · 1996

This paper shows how a moderate amount of random key stream can be used to generate a lifetime supply of keys for one-time pads. It further shows how arbitrarily many parties can correspond using the same random key, without compromising one another's communications. The net effect is to make the unbreakable one-time pad practical for widespread use.

Read the paper · More papers on PaperTik