Daniel J. Bernstein

From Wikipedia, the free encyclopedia

You have new messages (last change).
Daniel Bernstein
Daniel Bernstein

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 holds a Bachelor's degree in Mathematics from New York University (1991), and a PhD in Mathematics from University of California, Berkeley (1995), studying under Hendrik Lenstra.

Bernstein brought the court case Bernstein v. United States. As a result of the ruling in that case, software was declared protected speech under the First Amendment and national restrictions on encryption software were overturned. Bernstein was originally represented by the EFF. During later phases of the suit, Bernstein represented himself in court despite having no formal training as a lawyer.

Bernstein has also proposed Internet Mail 2000, an alternative system for electronic mail, intended to replace SMTP, POP3 and IMAP.

Bernstein is a controversial figure. On Usenet and his website, he has publicly argued with Wietse Venema and Paul Vixie regarding software and security; Matteo Frigo, author of FFTW, regarding FFT implementation and benchmarking; and Bruce Schneier and Arjen Lenstra regarding computational cost.

Contents

[edit] Software security

In the autumn of 2004, Bernstein began teaching one of the first formal university-level courses 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.

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 prevents it from doing anything besides transforming 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."[1]

As of Spring 2005, Bernstein was teaching a course on "High Speed Cryptography".[2] Bernstein demonstrated new results against AES in the same time period.[3]

[edit] Mathematics

Bernstein is a prolific publisher of papers in mathematics and computation. Many of his papers introduce advances in the state of the art for algorithms or implementations. However, he's also a meticulous chronicler of previous advances, for instance his brief but encyclopaedic "Multidigit multiplication for mathematicians".[4]

In 2001 Bernstein published "Circuits for integer factorization: a proposal,"[5] 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 emphasised 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.[6] 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] Dress style

Bernstein always dresses totally in black. This was parodied in a talk by Jon Sorenson at the ANTS VII conference in Berlin in July 2006: in his slides, Sorenson added a picture of a black shirt to each of his many references to Bernstein. Bernstein has been dressing this way since the early 1990s. When asked why he always dresses this way, he simply replies: "I like it".

[edit] References

  1. ^ Daniel J. Bernstein (2005-01-07). "Selected Research Activities".
  2. ^ Daniel J. Bernstein. MCS 590, High-Speed Cryptography, Spring 2005. Authenticators and signatures. Retrieved on September 23, 2005.
  3. ^ Daniel J. Bernstein (2004-04-17). "Cache timing attacks on AES". cd9faae9bd5308c440df50fc26a517b4.
  4. ^ Daniel J. Bernstein (2001-08-11). "Multidigit multiplication for mathematicians".
  5. ^ Daniel J. Bernstein (2001-11-09). "Circuits for integer factorization: a proposal".
  6. ^ Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, and Eran Tromer (2002). "Analysis of Bernstein's Factorization Circuit". proc. Asiacrypt LNCS 2501: 1–26. 

[edit] See also

[edit] Further reading

[edit] External links

Wikiquote has a collection of quotations related to:
Retrieved from "http://en.wikipedia.org../../../d/a/n/Daniel_J._Bernstein_bdd4.html"