- Daniel Bleichenbacher
-
Daniel Bleichenbacher (born 1964) is a Swiss cryptographer, previously a researcher at Bell Labs, and currently employed at Google. He received his Ph.D. from ETH Zurich in 1996 for contributions to computational number theory, particularly concerning message verification in the ElGamal and RSA public-key cryptosystems.[1]
In 1998, Daniel Bleichenbacher demonstrated a practical attack against systems using RSA encryption in concert with the PKCS#1 v1 encoding function, including a version of the Secure Socket Layer (SSL) protocol used by thousands of web servers at the time.[2] This attack was the first practical reason to consider adaptive chosen-ciphertext attacks.
In 2006 at a rump session at CRYPTO, Bleichenbacher described a "pencil and paper"-simple attack against RSA signature validation as implemented in common cryptographic toolkits. Both OpenSSL and the NSS security engine in Firefox were later found to be vulnerable to the attack, which would allow an attacker to forge the SSL certificates that protect sensitive websites.[3]
References
- ^ http://cr.yp.to/bib/1996/bleichenbacher-thesis.ps
- ^ Bleichenbacher, Daniel (1998). "Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1" (PDF). CRYPTO '98. pp. 1–12. http://www.springerlink.com/index/j5758n240017h867.pdf. Retrieved 2009-01-13.
- ^ Bleichenbacher's RSA signature forgery based on implementation error
External links
Categories:- Modern cryptographers
- 1964 births
- Living people
- Google employees
- Cryptography stubs
- Computer scientist stubs
Wikimedia Foundation. 2010.