One-Time Pad: Perfect Secrecy
The one-time pad (OTP, also known as a Vernam System) has been repeatedly demonstrated to be perfectly secure, first—and most prominently—by noted American mathematician Claude Shannon, known as “the father of information theory.” Shannon’s seminal 1949 paper Communication Theory of Secrecy Systems proves that the OTP is unbreakable when used properly.
True Random Numbers: Beyond Math
We use TRNG devices that capture the random output from these processes and provide random bytes for our RCPs. We verify the randomness of the TRN output using Duke University’s Dieharder 3.31.1, NIST Statistical Test Suite SP 800-90B, NIST SP800-22 r1a STS Suite, TectroLabs Bitcount Test, and the Fourmilab ENT program. Using Ubuntu 17.10 running on a Windows 10 VirtualBox, the tests included only raw data without whitening or post processing. The results have consistently proven the entropy (mathematical randomness) of 8-bit bytes is 7.9+, which is the equivalent of “five nines,” or 99.999% random—as close to perfectly random as can be proven.