Exploring Number Theory: From Prime Numbers to Cryptographic Algorithms
DOI:
https://doi.org/10.36676/mdmp.v1.i3.36Keywords:
Number Theory, Prime Numbers, Cryptography, RSA AlgorithmAbstract
Number theory, a branch of pure mathematics devoted to the study of integers and integer-valued functions, has profound implications in various fields, particularly in cryptography. This paper delves into the intricate world of number theory, tracing its historical development and highlighting its pivotal role in modern cryptographic algorithms. We begin by exploring fundamental concepts such as prime numbers, greatest common divisors, and modular arithmetic, which form the bedrock of number theory. The significance of prime numbers is underscored by their application in key cryptographic methods, including the RSA algorithm and elliptic curve cryptography. the use of number theoretic functions and theorems, such as Euler's totient function, Fermat's Little Theorem, and the Chinese Remainder Theorem, in constructing robust cryptographic systems. These mathematical principles ensure the security and efficiency of encryption and decryption processes, underpinning the protection of sensitive data in digital communications.
References
Ayyalasomayajula, Madan Mohan Tito, Gayatri Parasa, et al. ‘Towards Industry 5.0: Study of Artificial Intelligence in Areas of Application - A Methodological Approach’. Journal of Information and Optimization Sciences, vol. 45, no. 8, Taru Publications, 2024, pp. 2261–2271.
Ayyalasomayajula, Madan Mohan Tito, Vishwanadham Mandala, et al. ‘Cyber-Attack Detection Using Gradient Clipping Long Short-Term Memory Networks in Internet of Things’. 2024 Asian Conference on Communication and Networks (ASIANComNet), IEEE, 2024, pp. 1–6.
Ayyalasomayajula, Madan Mohan Tito, Akshay Agarwal, et al. ‘Reddit Social Media Text Analysis for Depression Prediction: Using Logistic Regression with Enhanced Term Frequency-Inverse Document Frequency Features’. International Journal of Electrical and Computer Engineering (IJECE), vol. 14, no. 5, 2024, pp. 5998–6005.
Burton, D. M. (2011). Elementary Number Theory (7th ed.). McGraw-Hill.
Gordon, D. M. (1998). Discrete logarithms in GF(p) using the number field sieve. SIAM Journal on Discrete Mathematics, 6(1), 124-138.
Koblitz, N. (1994). A Course in Number Theory and Cryptography (2nd ed.). Springer.
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of Applied Cryptography. CRC Press.
Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
Rosen, K. H. (2012). Elementary Number Theory and Its Applications (6th ed.). Pearson.
Silverman, J. H. (2006). A Friendly Introduction to Number Theory (4th ed.). Pearson.
Stinson, D. R., & Paterson, M. (2019). Cryptography: Theory and Practice (4th ed.). CRC Press.
Shoup, V. (2009). A Computational Introduction to Number Theory and Algebra (2nd ed.). Cambridge University Press.
Washington, L. C. (2008). Elliptic Curves: Number Theory and Cryptography (2nd ed.). CRC Press.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Modern Dynamics: Mathematical Progressions
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
This license requires that re-users give credit to the creator. It allows re-users to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.
