Photo by Chunlea Ju on Unsplash

PKI Crumbles A Bit More

The RSA public key encryption method uses two prime numbers: p and q, and then calculates a modulus (N=p*q). If we can find one of the random prime numbers, we can easily find the other one, and then can determine the private key from the public key value. We thus need to make sure we have a completely random prime number, and one which is not easily guessable. But Keyfactor scanned over 75 million RSA certificates certficates on the Internet and…

--

--

--

This publication brings together interesting articles related to cyber security.

Recommended from Medium

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Prof Bill Buchanan OBE

Prof Bill Buchanan OBE

Professor Cryptography. Serial innovator. Believer in fairness, justice & freedom. EU Citizen in heart. Living by the sea. Old World Breaker. New World Creator.