5 ms·
The ways in which encryption algorithms fail with bad inputs vary widely. One older and real-world example is DSA vs. RSA: if you use the same random number tw
by geofft 10y ago
The ways in which encryption algorithms fail with bad inputs vary widely.
One older and real-world example is DSA vs. RSA: if you use the same random number twice when making DSA signatures, an attacker can recover the private key. Or if you use different random numbers, but you don't keep them secret, an attacker can also recover the private key. This is a real problem if you happen to use, say, Debian when it had the the OpenSSL RNG bug. RSA has no such flaw; the attacker would need you to have made a series of much-more-unlikely mistakes to recover a private key out of RSA.
See also https://www.imperialviolet.org/2013/06/15/suddendeathentropy.html https://www.imperialviolet.org/2013/06/15/suddendeathentropy...
If you're wondering why GPG, OpenSSH, etc. started defaulting to RSA in the past few years, that's why. (If you're wondering why they originally picked DSA, patents.)
- rockdoe 10y agoDSA also has much smaller signatures, which surely was a nice advantage. On top of that, DSA was limited to 1024 bit keys and 160 bit hashes until the standard was extended and the extension propagated to implementations again. RSA signatures gained a lot of use while this was happening.
- nly 10y agoWorth mentioning that ECDSA suffers the same problems as classic DSA if you reuse a nonce (for different messages). This lead to the extraction of a Playstation 3 signing key. Why does DSA suck? Patents. It was designed to work around patents in the much simpler and Schnorr signature scheme (which is immune to nonce reuse due to the way message content and nonce are hashed together).