TSRG randomized cryptosystem

This paper discusses the use of randomized encryption techniques for designing an algorithm of a provably secure two stage RNG (TSRG) cryptosystem for message exchange. A built-in TSRG RNG is a distinguishable primitive in the proposed cryptosystem design where instantaneous real time. One time pad (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, computing technology and unpublished researches 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 RNG implements a simple idea of reseeding the RNG at unpredictable instants to an unpredictable state creating a new RNG model before the attackers can acquire enough information to identify the current model. In TSRG design, security is based on a proven insoluble problem. The previous published work proves that TSRG RNG produced output is random and cannot be predicated using available technologies and mathematical theories if the state of the generator is not compromised. This requires a secure way of exchanging of the OTP-like digest to be expanded at the receiver side as well as preventing the attackers from mounting state compromise attacks. The paper discuses how randomized encryption techniques can aid in designing the TSRG cryptosystem to defend possible cracking trials. Suitable usage of two randomized encryption techniques eliminates the threat of message related attacks and smoothes out the statistical distribution of inputs to the algorithm.