Implementation of RSA algorithm Using Mersenne Prime

Cryptographic algorithms are oftenly based on large prime numbers. It is a difficult task to generate large prime numbers and test it for primality. This requires overheads on first generating a large number which should be probably prime and second, testing its primality. This is because the generated large prime number using different algorithms? may not necessarily pass the primality test. In order to generate an assured large prime number we can make use of Mersenne primes. Small mersenne primes are the used to generate large primes. This paper implements RSA based cryptographic algorithm using mersenne prime.