Randomized Cryptosystems Attacks and Defenses

In this paper, an evaluation of (one time pad) OTP, Rabin everlasting encryption and two stage random number generator (TSRG) randomized cryptosystems are introduced. TSRG uses randomized encryption techniques for designing an algorithm of a provably secure cryptosystem for message exchange. A built-in TSRG RNG is a distinguishable primitive in the proposed cryptosystem design where instantaneous real time OTP-like data is generated. Most cryptography relies on unproven complexity assumptions like integer factorization being computationally hard, with the adversary limited by computing power. However, advances in cryptanalysis, unpublished researches and computing technology, especially in the emerging quantum cryptography, may make current cryptosystems insecure. Shannon´s pessimistic result essentially denotes that if the adversary is all-powerful, then efficient practical solutions for information-theoretic security do not exist. However, the TSRG use the concept of dynamic modeling to achieve provable security based on insoluble problem with respect to attacker. This requires a secure way of exchanging of the OTP-like special seed to be expanded at the receiver side as well as preventing the attackers from mounting state compromise attacks. The paper also explains the relation among the three discussed cryptosystems and randomized encryption techniques