Implementation of RSA Algorithm with Variable N-Padding Technique and Miller- Rabin Test for Auto-Generated Large Keys from System Date

The RSA cryptosystem, invented by Ron Rivest, Adi Shamir and Len Adleman was first publicized in the August 1977 issue of Scientific American [15]. The cryptosystem is most commonly used for providing privacy and ensuring authenticity of digital data. The security levels of this algorithm very much depend on two large prime numbers [7], [18]. But, to handle large prime in personal computer is huge time consuming [1]. So The Miller-Rabin algorithm is used for testing the primes [2]. The keys n, e and d are generated combining system time and date. The user also has the option for entering keys of the desired length for this implementation. But the problem exists defined in [6], [8] with simple RSA for the plaintext. So a new technique for padding scheme is introduced so that the addressing problem in [6] (where plaintext is chosen as a small number) which can be solved.