[–] JensRantil 10y ago ↗ Looks a lot of them were all using a non-prime public exponents. Probably generated using a broken prime number generator... [–] xigency 10y ago ↗ The public exponent in an RSA key doesn't have to be prime, only relatively prime to the totient of the product of the two primes. [–] ctz 10y ago ↗ You don't generate public exponents. Also, public exponents do not need to be prime, only relatively prime to phi(n) so inverses can be computed.
[–] xigency 10y ago ↗ The public exponent in an RSA key doesn't have to be prime, only relatively prime to the totient of the product of the two primes.
[–] ctz 10y ago ↗ You don't generate public exponents. Also, public exponents do not need to be prime, only relatively prime to phi(n) so inverses can be computed.
[–] tptacek 10y ago ↗ Not really, no. This story is a dupe:https://news.ycombinator.com/item?id=11609909 [–] acqq 10y ago ↗ And the title is given by the submitter and is misleading.
5 comments
[ 4.7 ms ] story [ 20.0 ms ] threadhttps://news.ycombinator.com/item?id=11609909