Computer scientist Peter Gutmann tells The Reg why it's 'bollocks' The US National Institute for Standards and Technology ...

RSA is a different algorithm with a longer history and a broader adoption, at least in the past. It depends upon the complexity of factoring large numbers.

A recent research paper makes the claim that the RSA cryptographic algorithm can be broken with a quantum algorithm. Skeptics warn: don’t believe everything you read.

Adi Shamir, the S in the RSA algorithm and a cofounder of RSA Security, went off on cryptocurrency, saying its early promise has been wasted. While he said Satoshi Nakamoto's paper [PDF] on ...

The authors note that even though a quantum computer running Shor’s algorithm would be faster than a classical computer, the RSA algorithm is faster than both. And the larger the RSA “key” — the ...

Researchers at Black Hat USA 2013 made a call for usage of elliptic curve cryptography in favor of the RSA algorithm, which the experts said could be cracked in the next five years.

A toy RSA algorithm. The RSA algorithm is the most popular and best understood public key cryptography system. Its security relies on the fact that factoring is slow and multiplication is fast.

Despite RSA's gesture, several competitors who have paid royalties for use of the algorithm for up to 17 years, argue that the industry could have done with the patent relaxation earlier.

The RSA algorithm has become an encryption standard for many e-commerce security applications. The patent for it was issued to MIT on Sept. 20, 1983, and licensed exclusively to RSA Security.

The RSA algorithm works as follows: First, I find two huge (at least 100 digits each!) prime numbers p and q , and then I multiply them together to get the even bigger number N .