Git hosting

cryptopals: Solutions to the cryptopals crypto challenges in Ruby

Files

Size Path
..
1512 41.md
1406 41.rb
2690 42.md
2139 42.rb
2676 43.md
2620 43.rb
1603 44.md
1734 44.rb
2179 44.txt
895 45.md
1340 45.rb
2243 46.md
1165 46.rb
3150 47.md
2531 47.rb
2125 48.md
2667 48.rb
1166 README.md

README.md

Crypto Challenge Set 6

This is the last of our original crypto challenges.

This set exclusively covers number-theoretic cryptography, and, in particular, RSA and DSA.

This set is hard. The concepts are again new. The attacks involve some math --- but nothing you didn't learn in 9th grade --- and a significant amount of programming.

But they're worth it. Two of these attacks in particular are among the most valuable in real-world cryptography.

  1. Implement unpadded message recovery oracle
  2. Bleichenbacher's e=3 RSA Attack
  3. DSA key recovery from nonce
  4. DSA nonce recovery from repeated nonce
  5. DSA parameter tampering
  6. RSA parity oracle
  7. Bleichenbacher's PKCS 1.5 Padding Oracle (Simple Case)
  8. Bleichenbacher's PKCS 1.5 Padding Oracle (Complete Case)