Keywords
How to Cite
Abstract
This thesis analyzes prime number generation methods employed in modern cryptographic systems and examines their underlying mathematical principles. The study explores the generation of large prime numbers, random number generation mechanisms, and the operational characteristics of primality testing algorithms. The performance, efficiency, and practical benefits of the Fermat and Miller–Rabin tests in the prime generation process are evaluated. Furthermore, the concept of safe primes and their significance in public-key cryptographic frameworks, including RSA and Diffie–Hellman systems, are investigated. The findings demonstrate that prime number generation algorithms play a vital role in maintaining the security, reliability, and robustness of cryptographic systems.
References
1. Stallings W. Cryptography and Network Security. — Pearson, 2017.
2. Rivest R., Shamir A., Adleman L. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”. Communications of the ACM, 1978.
3. Menezes A., van Oorschot P., Vanstone S. Handbook of Applied Cryptography. — CRC Press, 1996.
4. Rabin M. O. “Probabilistic Algorithm for Testing Primality”. Journal of Number Theory, 1980.
5. Bernstein D., Buchmann J., Dahmen E. Post-Quantum Cryptography. — Springer, 2009.
6. Hardy G. H., Wright E. M. An Introduction to the Theory of Numbers. — Oxford University Press, 2008.
7. Paar C., Pelzl J. Understanding Cryptography. — Springer, 2010.
8. Rosen K. H. Elementary Number Theory and Its Applications. — Pearson, 2010.
9. Carmichael R. D. “On Composite Numbers P Which Satisfy the Fermat Congruence”. American Mathematical Monthly, 1910.
10. Miller G. L. “Riemann’s Hypothesis and Tests for Primality”. Journal of Computer and System Sciences, 1976.
11. Rabin M. O. “Probabilistic Algorithm for Testing Primality”. Journal of Number Theory, 1980.
12. Schneier B. Applied Cryptography. — Wiley, 1996.
13. Rivest R., Shamir A., Adleman L. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”. Communications of the ACM, 1978. Signatures and Public-Key Cryptosystems”. Communications of the ACM, 1978.
14. Kelsey J., Schneier B., Ferguson N. Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator. — Selected Areas in Cryptography, Springer, 1999.
15. Crandall R., Pomerance C. Prime Numbers: A Computational Perspective. — Springer, 2005.
16. Peter Shor “Algorithms for Quantum Computation: Discrete Logarithms and Factoring”. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994.