Everything You Wanted To Know about Integer Factorization, but Were Afraid To Ask ..

Defining The Limits of RSA Cracking

Coinmonks
Published in
6 min readAug 5, 2018

--

Many of our public key methods involve the multiplication of prime numbers. For example the security of RSA is based on the multiplication of two prime numbers (P and Q) to give the modulus value (N). If we can crack the N value, we will crack the decryption key…

--

--

Prof Bill Buchanan OBE FRSE
Coinmonks

Professor of Cryptography. Serial innovator. Believer in fairness, justice & freedom. Based in Edinburgh. Old World Breaker. New World Creator. Building trust.