Paper 2014/576

Vernam Two

Dan P. Milleville

Abstract

The Vernam cipher is the only known engine to be mathematically perfect. Its drawback is the key needs to be sent along with the ciphertext because it is a one-time pad. This submission shows how, with a fixed key table, a non-repeating stream key of at least 128 Gigabytes can be and is constructed so as to preclude the requirement of the key being transmitted with the ciphertext.

Note: Correcting 2 typos and minor format errors