Details of generating primes for cryptography
The Endeavour 2024-12-31
Summary:
RSA public key cryptography begins by finding a couple large primes. You essentially do this by testing random numbers until you find primes, but not quite. Filippo Valsorda just posted a good article on this. Suppose you’re looking for a 1024-bit prime number. You generate random 1024-bit numbers and then test until you find one […]
The post Details of generating primes for cryptography first appeared on John D. Cook.