Daniel J. Bernstein

From Wikipedia, the free encyclopedia

Jump to: navigation, search
Daniel J. Bernstein
166
Daniel Bernstein
Born September 29, 1971 (1971-09-29) (age 37)
Education Mathematics
Known for qmail, djbdns
Title Professor
Website
http://cr.yp.to/djb.html

Daniel Julius Bernstein (sometimes known simply as djb; born October 29, 1971) is a professor at the University of Illinois at Chicago, a mathematician, a cryptologist, and a programmer. Bernstein is the author of the computer software qmail, publicfile and djbdns. He has a Bachelor's degree in Mathematics from New York University (1991), and a PhD in Mathematics from the University of California, Berkeley (1995), studying under Hendrik Lenstra. He attended Bellport High School, a public high school on Long Island.[1]

Bernstein brought the court case Bernstein v. United States. The ruling in the case declared software as protected speech under the First Amendment, and national restrictions on encryption software were overturned. Bernstein was originally represented by the Electronic Frontier Foundation, but later represented himself despite having no formal training as a lawyer.[2]

Bernstein has also proposed Internet Mail 2000, an alternative system for electronic mail, intended to replace Simple Mail Transfer Protocol (SMTP), Post Office Protocol (POP3) and Internet Message Access Protocol (IMAP).[3]

Contents

[edit] Software security

In the autumn of 2004, Bernstein taught a course about computer software security, titled "UNIX Security Holes". The 16 members of the class discovered 91 new UNIX security holes. Bernstein, long a promoter of the idea that full disclosure is the best method to promote software security and founder of the securesoftware mailing list, publicly announced 44 of them with sample exploit code. This received some press attention and rekindled a debate over full disclosure.[citation needed]

Bernstein has recently explained that he is pursuing a strategy to "produce invulnerable computer systems". Bernstein plans to achieve this by putting the vast majority of computer software into an "extreme sandbox" that only allows it to transform input into output, and by writing bugfree replacements (like qmail and djbdns) for the remaining components that need additional privileges. He concludes: "I won’t be satisfied until I've put the entire security industry out of work."[4]

In spring 2005 Bernstein taught a course on "High Speed Cryptography".[5] Bernstein demonstrated new results against implementations of AES (cache attacks) in the same time period.[6]

Most recently, djb's stream cipher "Salsa20" was selected as a member of the final portofolio of the eSTREAM project, part of a European Union research directive.

[edit] Secure Software

Bernstein has written a number of security-aware programs, including:

Bernstein offers a security guarantee for qmail and djbdns; while some claim there is a dispute over a reported potential qmail exploit, no functioning exploits of any of these programs have been published, and the claimed exploit does not fall within the parameters of the qmail security guarantee.[7][8] In March 2009, Bernstein awarded $1000 to Matthew Dempsky for finding a security hole in djbdns.[9]

In August 2008, Bernstein announced[10] DNSCurve, a proposal to secure the Domain Name System. DNSCurve uses techniques from elliptic curve cryptography to give a vast decrease in computational time over the RSA public-key algorithm used by DNSSEC, and uses the existing DNS hierarchy to propagate trust by embedding public keys into specially formatted (but backward-compatible) DNS records.

[edit] Mathematics

Bernstein has published a number of papers in mathematics and computation. Many of his papers deal with algorithms or implementations. He also wrote a survey titled "Multidigit multiplication for mathematicians".[11]

In 2001 Bernstein circulated "Circuits for integer factorization: a proposal,"[12] which caused a stir as it potentially suggested that if physical hardware implementations could be close to their theoretical efficiency, then perhaps current views about how large numbers have to be before they are impractical to factor might be off by a factor of three. Thus as 512-digit RSA was then breakable, then perhaps 1536-bit RSA would be too. Bernstein was careful not to make any actual predictions, and emphasized the importance of correctly interpreting asymptotic expressions. However, several other important names in the field, Arjen Lenstra, Adi Shamir, Jim Tomlinson, and Eran Tromer disagreed strongly with Bernstein's conclusions.[13] Bernstein has received funding to investigate whether this potential can be realized.

Bernstein is also the author of the mathematical libraries DJBFFT, a fast portable FFT library, and of primegen, an asymptotically fast small prime sieve with low memory footprint based on the sieve of Atkin rather than the more usual sieve of Eratosthenes. Both have been used effectively to aid the search for large prime numbers.

[edit] See also

[edit] Notes

  1. ^ "New Yorkers Excel In Contest". New York Times. 1987-01-21. http://query.nytimes.com/gst/fullpage.html?res=9B0DE1D81E3CF932A15752C0A961948260. Retrieved on November 9 2008. 
  2. ^ [1]
  3. ^ [2]
  4. ^ Daniel J. Bernstein (2005-01-07) (PDF). Selected Research Activities. http://cr.yp.to/cv/activities-20050107.pdf. 
  5. ^ Daniel J. Bernstein. "MCS 590, High-Speed Cryptography, Spring 2005". Authenticators and signatures. http://cr.yp.to/2005-590.html. Retrieved on September 23 2005. 
  6. ^ Daniel J. Bernstein (2004-04-17) (PDF). Cache timing attacks on AES. cd9faae9bd5308c440df50fc26a517b4. http://cr.yp.to/antiforgery/cachetiming-20050414.pdf. 
  7. ^ Georgi Guninski (2005-05-31). "Georgi Guninski security advisory #74, 2005". http://www.guninski.com/where_do_you_want_billg_to_go_today_4.html. Retrieved on September 23 2005. 
  8. ^ James Craig Burley (2005-05-31). "My Take on Georgi Guninski's qmail Security Advisories". http://www.jcb-sc.com/qmail/guninski.html. 
  9. ^ Daniel J. Bernstein (2009-03-04). "djbdns<=1.05 lets AXFRed subdomains overwrite domains". http://article.gmane.org/gmane.network.djbdns/13864. 
  10. ^ Daniel J. Bernstein. "High-speed cryptography". http://marc.info/?l=djbdns&m=122011940521548&w=2. 
  11. ^ Daniel J. Bernstein (2001-08-11). Multidigit multiplication for mathematicians. http://cr.yp.to/papers.html#m3. 
  12. ^ Daniel J. Bernstein (2001-11-09). Circuits for integer factorization: a proposal. http://cr.yp.to/papers.html#nfscircuit. 
  13. ^ Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, and Eran Tromer (2002). "Analysis of Bernstein's Factorization Circuit". proc. Asiacrypt LNCS 2501: 1–26. http://www.wisdom.weizmann.ac.il/~tromer/papers/meshc/meshc.html. 

[edit] Further reading

[edit] External links

Sister project Wikiquote has a collection of quotations related to: Daniel J. Bernstein
Retrieved from "http://en.wikipedia.org/wiki/Daniel_J._Bernstein"
Personal tools