Re:Return of Bleichenbacher's Oracle Threat
by craigyoung on Tuesday December 12, 2017 @10:38AM
(#15906303)
Want to put the skills you learned from those challenges to good use?
There's also a CTF at https://ctf.robotattack.org
Re:Return of Bleichenbacher's Oracle Threat
by CiPHPerCoder on Tuesday December 12, 2017 @12:57PM
(#15907778)
> Take a crypto vulnerability everyone assumes has been eradicated for years
I wish!
http://cryptopals.com/sets/6/challenges/46 (and 47, 48).
Bleichenbacher's RSA oracle --- some people call it BB'98 --- is the RSA equivalent of the best-known real-world attack on crypto, the CBC padding oracle. The math behind the exploit is a little trickier (it's 10th grade algebra, plus the very basic finite field stuff you'd get in a single decent blog post on how RSA works) but it's otherwise mechanically pretty similar.
The basic idea is: the client sends the server messages; it can send any message it wants, valid or not. The server processes those messages. In doing so, it causes the message to interact with the server's private key. Once that interaction happens, any observable behavior the server exhibits can be used to infer things about that key. In the case of a padding oracle: send random messages; see if you can detect the padding validation error from the server. Based on that one signal, establish new bounds for the key.
This paper is pure Hanno Böck. His M.O. is straightforward and awesome. Take a crypto vulnerability everyone assumes has been eradicated for years, especially on serious hosts. Now, here's the tricky part: scan the Internet for it. Oh, look: it's everywhere. Including CISCO.COM and FACEBOOK.COM and a gajillion F5 devices.