On lucky primes and their application to Rivest, Shamir, and Adleman (RSA) cryptosystem
Loading...
Date
2016-10
Journal Title
Journal ISSN
Volume Title
Publisher
American Institute of Physics Inc.
Abstract
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.
Description
Abstract only
Keywords
Citation
Alcantara, N. L. M. T., Cabilatazan, J. A. M. S., Mayugba, J. A., & Disu, D. A. A. (2016). AIP Conference Proceedings. https://doi.org/10.1063/1.4965131
Collections
Total visits
| views | |
|---|---|
| On lucky primes and their application to Rivest, Shamir, and Adleman (RSA) cryptosystem | 4 |
File Visits
| views | |
|---|---|
| PUB-CP-MLUC-2016-AlcantaraNLMT-ABS.pdf | 2 |