On January 12, 2023, the author delves into the world of prime numbers, expressing fascination with their simplicity yet endless complexity, showcasing their importance in various fields like cryptography. The author embarks on a challenge to generate primes for RSA Algorithm keys using Rust programming language, starting small with 16-bit primes and gradually moving to larger sizes like 64-bit and 128-bit. As the complexity increases, the author explores Fermat’s Little Theorem and the Miller-Rabin Primality Test to generate primes efficiently. The journey reveals challenges like overflow issues and the presence of “Fermat Pseudoprimes.” Despite obstacles, the author showcases a resilient spirit in decoding the enigmatic world of prime numbers.
https://glitchcomet.com/articles/1024-bit-primes/