Perfect randomness is often viewed as a stringent requirement to attain perfect secrecy. This is true in the case of One-Time Pad.

To attain Shannon Security, a key should be perfectly unpredictable random data. Perfect randomness is applicable to the True One-Time Pad simply because the key is directly applied with the plain text hence it is vulnerable to cryptanalytic attacks. If the key material is not truly random, the ciphertext could leak information and the message could be deduced eventually.

Perfect randomness cannot be attained using Pseudo Random Generators (PRNG's) or any algorithms. The output could appear random but the security only lies with the seed of the PRNG which could be subjected to exhaustive attacks. If a secret algorithm is used on software, a clever hacker could possibly analyze and derive the algorithm. Secure encryption software therefore must not rely on the secrecy of the methods or algorithms used.

Absolute randomness is not the only key to perfect secrecy. Belief to the contrary is a delusion.

Infinite One-Time Pad implements the use of any file as a source of key material. To generate a key with unpredictable data from a key file, the algorithm must be irreversible. Cryptanalysts must not be able to determine the original key even if both the algorithm and the transformed key are known. If this is met, even a simple text file could be used as a source of secure key material.

Infinite One-Time Pad works on both the key and the plain text to produce a ciphertext that cannot be analyzed. The plain text is compressed and transformed. The key is also transformed using series of different irreversible algorithms. The compression information is already lost and cannot be recovered from the ciphertext.

The attacker must provide the exact key or else it will fail to decompress. It is impossible for an attacker to reconstruct the exact key by any means. Ciphertext generated using Infinite One-Time Pad does not leak information hence; perfect randomness is not a stringent requirement. The key transformed using the irreversible algorithms has high unpredictability. Moreover, if password protection is used, the ciphertext cannot be broken by brute force. If the password is wrong, it will fail to decompress even if the key is correct.

Download Now