Number theory and cryptographic applications: Prime factorization in digital security
DOI:
https://doi.org/10.33448/rsd-v14i10.49705Keywords:
Number Theory, Prime factorization, Cryptography, RSA, Post-Quantum cryptography.Abstract
Given our strong dependence on computers and online resources, data protection has become crucial. Number Theory, especially prime factorization, plays a fundamental role in current cryptographic systems such as RSA, ensuring that information remains confidential and authentic. This study aims to examine how prime factorization is employed in cryptography, addressing factoring methods, the functioning of RSA, its limitations, and the impact of quantum computers. It also addressed the need for encryption resistant to quantum attacks and the integration of different fields such as mathematics, technology, and regulation. The results indicate that mathematics not only supports digital security but also needs to continuously adapt to new technologies and emerging threats. Therefore, research and the development of new security strategies are indispensable.
References
Burton, D. M. (2011). Elementary Number Theory. (7.ed). New York: McGraw-Hill
Cox, D. A. (2013). Primes of the Form x² + ny²: Fermat, Class Field Theory, and Complex Multiplication. (2. ed.). Hoboken: Wiley, 2013.
Hardy, G. H. & Wright, E. M. (2008). An Introduction to the Theory of Numbers. (6.ed). Oxford: Oxford University Press.
Katz, J. & Lindell, Y. (2014). Introduction to Modern Cryptography. (2.ed). Chapman & Hall/CRC.
Lenstra, A. K. & Verheul, E. R. (2001). Selecting Cryptographic Key Sizes. Journal of Cryptology. 14(4), 255–93.
Miller, G. L. (1976). Riemann's Hypothesis and Tests for Primality. Journal of Computer and System Sciences. 13(Issue 3), 300-17.
NIST. (2022). Post-Quantum Cryptography Standardization. National Institute of Standards and Technology.
Pereira, A. S. et al. (2018). Metodologia da pesquisa científica. [free ebook]. Santa Maria. Editora da UFSM.
Pollard, J. M. (1975). A Monte Carlo Method for Factorization of Integers. Mathematics of Computation. Scientific Notes. 15, 331–4.
Rabin, M. O. (1980). Probabilistic Algorithm for Testing Primality. Journal/Conference (Miller–Rabin test variants).
Rivest, R., Shamir, A. & Adleman, L. (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM. 21(2), 120-6.
Rosen, K. H. (2011). Elementary Number Theory and Its Applications. (6.ed). Pearson.
Rother, E. T. (2007). Revisão sistemática x revisão narrative. Acta Paulista de Enfermagem. 20(2), 5-6.
Shor, P. W. (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing. 26(5), 1484–509.
Singh, S. (2000). The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Anchor.
Stallings, W. (2017). Cryptography and Network Security: Principles and Practice. (7.ed). Pearson.
Stewart, I. & Tall, D. (2015). Algebraic Number Theory and Fermat’s Last Theorem. (4.ed). Boca Raton: CRC Press.
Stinson, D. R. & Paterson, M. B. (2018). Cryptography: Theory and Practice. (4.ed). Chapman & Hall/CRC.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Elijakson Rafael Lima de Souza, Márcia Maria da Silva, Noberto Ferreira Xavier, Ozilan Viana Brandão
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
1) Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2) Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3) Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
