Public Key Used To Secure HTTPS Fails ‘Sanity Check’

Researchers find two out of every 1,000 public keys can be easily cracked

The current public key infrastructure used to secure HTTPS has security shortcomings that–in some cases–could be exploited by attackers to steal data and attack servers.

That finding comes from a paperdue to be presented at the Crypto 2012 conference in August in Santa Barbara, Calif. The paper was written by a team of European and American mathematicians and cryptographers, led by Dutch mathematician Arjen K. Lenstra at the Ecole Polytechnique Federale de Lausanne (EPFL) in Switzerland. The researchers published their paper early, given the severity of the vulnerabilities they discovered.

We performed a sanity check of public keys collected on the Web,” wrote the researchers in their report. “Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended.”

But the researchers also discovered that public key encryption using the widely used RSA 1,024-bit algorithm is only 99.8% secure, at best, meaning that at least two out of every 1,000 public keys can be easily cracked.

[ What does the global community expect from the Internet? See Global Internet Culture Emerges. ]

“We were surprised…by the extent to which public keys are shared among unrelated parties,” said the researchers. “What surprised us most is that many thousands of 1,024-bit RSA moduli, including thousands that are contained in still valid X.509 certificates, offer no security at all.” Such X.509 certificates are used by certificate authorities to validate website identities, thus helping to secure everything from emails to online banking transactions.

“This comes as an unwelcome warning that underscores the difficulty of key generation in the real world,” James P. Hughes, an independent Silicon Valley cryptanalyst who worked with the team, told the New York Times.

For their research, the EPFL team used data from multiple sources, including the Electronic Frontier Foundation (EFF) SSL Observatory project, which stores downloads of all publicly-visible SSL certificates on the Internet, to allow researchers to search for HTTPS vulnerabilities.

What accounts for the unexpected repetition or sharing of keys that the researchers spotted? When an RSA key is generated, it requires picking two random prime numbers that haven’t been previously selected by anyone else using an RSA key. Anyone who uses the key will know these numbers, and use them–together with a public key created by the two prime numbers–to encrypt data.

To ensure that these two prime numbers don’t get picked more than once, NIST recommends that anyone generating an RSA key “use a random seed of bit-length twice the intended security level,” noted the researchers. “Clearly, this recommendation is not always followed.”

These vulnerable keys pose serious risks to Internet security, because anyone able to identify the two prime numbers used to generate an RSA key could then bypass that key’s protections. “In all cases, a weak key would allow an eavesdropper on the network to learn confidential information, such as passwords or the content of messages, exchanged with a vulnerable server,” said the EFF’s Dan Auerbach, a staff technologist, and Peter Eckersley, technology projects director, in a blog post. Furthermore, they said that in some cases, “sophisticated attackers could extract passwords and data from stored copies of previous encrypted sessions,” or launch man-in-the-middle attacks “to inject malicious data into encrypted sessions.”

The EFF said it will be working with the EPFL team to warn operators of any servers affected by the vulnerability. But the EPFL researchers have cautioned that their findings might have already been known to others. “The lack of sophistication of our methods and findings make it hard for us to believe that what we have presented is new, in particular to agencies and parties that are known for their curiosity in such matters,” said the researchers. They said that their findings might also help to explain why NIST in 1991 bypassed RSA, and instead picked Digital Signature Algorithm (DSA) as its digital signature standard. Notably, DSA only requires selecting a single prime number, and the researchers found only a few cases in which two people had apparently selected the same prime number.


Leave a Reply

Please log in using one of these methods to post your comment: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s