On lucky primes and their application to Rivest, Shamir, and Adleman (RSA) cryptosystem
Nialle Loui Mar T. Alcantara, Julie Ann Marie S. Cabilatazan, Jhun-Jhun A. Mayugba, Daisy Ann A. Disu · AIP conference proceedings · 2016
This research study deals with the formulation of an algorithm in finding lucky primes while methodically testing the primality of each. New and different behaviors of lucky primes and related concepts have been explored and exploited to come up with underlying propositions that were supported by proofs made by the researchers. Using these properties, the researchers developed a computer application using the Python programming language in order to generate lucky primes up to certain limit. They tested the viability of using lucky primes as a substitute cryptovariable in a computer program that implements the RSA cryptosystem in encrypting and decrypting messages.