On lucky primes and their application to Rivest, Shamir, and Adleman (RSA) cryptosystem

Simple item page
dc.contributor.authorAlcantara, N. L. Mar T.
dc.contributor.authorCabilatazan, Julie Ann Marie S.
dc.contributor.authorMayugba, Jhun-Jhun A.
dc.contributor.authorDisu, Daisy Ann A.
dc.date.accessioned2026-09-01T07:56:47Z
dc.date.available2026-09-01T07:56:47Z
dc.date.issued2016-10
dc.descriptionAbstract only
dc.description.abstractThis 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.
dc.identifier.citationAlcantara, 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
dc.identifier.doihttps://doi.org/10.1063/1.4965131
dc.identifier.isbn978-073541433-4
dc.identifier.urihttps://lakasa.dmmmsu.edu.ph/handle/123456789/2438
dc.language.isoen
dc.publisherAmerican Institute of Physics Inc.
dc.sdgSDG 9
dc.titleOn lucky primes and their application to Rivest, Shamir, and Adleman (RSA) cryptosystem
dc.typeConference paper
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
PUB-CP-MLUC-2016-AlcantaraNLMT-ABS.pdf
Size:
308.78 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Conference Papers