Category Archives: cryptanalysis

RSA-240 Factored

Posted on by

This just in: We are pleased to announce the factorization of RSA-240, from RSA’s challenge list, and the computation of a discrete logarithm of the same size (795 bits): RSA-240 = 12462036678171878406583504460810659043482037465167880575481878888328 966680118821085503603957027250874750986476843845862105486553797025393057189121 768431828636284694840530161441643046806687569941524699318570418303051254959437 1372159029236099 = 509435952285839914555051023580843714132648382024111473186660296521821206469746 700620316443478873837606252372049619334517 * 244624208838318150567813139024002896653802092578931401452041221336558477095178 155258218897735030590669041302045908071447 […] The previous records were RSA-768 (768 bits) in December 2009 [2], and a 768-bit prime discrete logarithm in… Continue reading RSA-240 Factored→

The NSA Warns of TLS Inspection

Posted on by

The NSA has released a security advisory warning of the dangers of TLS inspection: Transport Layer Security Inspection (TLSI), also known as TLS break and inspect, is a security process that allows enterprises to decrypt traffic, inspect the decrypted content for threats, and then re-encrypt the traffic before it enters or leaves the network. Introducing this capability into an enterprise… Continue reading The NSA Warns of TLS Inspection→

The NSA Warns of TLS Inspection

Posted on by

The NSA has released a security advisory warning of the dangers of TLS inspection: Transport Layer Security Inspection (TLSI), also known as TLS break and inspect, is a security process that allows enterprises to decrypt traffic, inspect the decrypted … Continue reading The NSA Warns of TLS Inspection→

Factoring 2048-bit Numbers Using 20 Million Qubits

Posted on by

This theoretical paper shows how to factor 2048-bit RSA moduli with a 20-million qubit quantum computer in eight hours. It’s interesting work, but I don’t want overstate the risk. We know from Shor’s Algorithm that both factoring and discrete logs are … Continue reading Factoring 2048-bit Numbers Using 20 Million Qubits→

Factoring 2048-bit Numbers Using 20 Million Qubits

Posted on by

This theoretical paper shows how to factor 2048-bit RSA moduli with a 20-million qubit quantum computer in eight hours. It’s interesting work, but I don’t want overstate the risk. We know from Shor’s Algorithm that both factoring and discrete logs are easy to solve on a large, working quantum computer. Both of those are currently beyond our technological abilities. We… Continue reading Factoring 2048-bit Numbers Using 20 Million Qubits→

More Cryptanalysis of Solitaire

Posted on by

In 1999, I invented the Solitaire encryption algorithm, designed to manually encrypt data using a deck of cards. It was written into the plot of Neal Stephenson’s novel Cryptonomicon, and I even wrote an afterward to the book describing the cipher. I don’t talk about it much, mostly because I made a dumb mistake that resulted in the algorithm not… Continue reading More Cryptanalysis of Solitaire→

Crown Sterling Claims to Factor RSA Keylengths First Factored Twenty Years Ago

Posted on by

Earlier this month, I made fun of a company called Crown Sterling, for…for…for being a company that deserves being made fun of. This morning, the company announced that they "decrypted two 256-bit asymmetric public keys in approximately 50 seconds from a standard laptop computer." Really. They did. This keylength is so small it has never been considered secure. It was… Continue reading Crown Sterling Claims to Factor RSA Keylengths First Factored Twenty Years Ago→