Susan Landau

Susan Eva Landau ( born June 3, 1954 in New York) is an American computer scientist and known as an expert on information security issues.

Landau studied at Princeton University (Bachelor 1976), Cornell University ( Master's degree in 1979 ) and the Massachusetts Institute of Technology, where she received her doctorate in 1983. She was at the University of Massachusetts, Wesleyan University and a visiting scientist at Cornell University, Yale University and MSRI.

She was then an engineer at Sun Microsystems Laboratories ( most recently as Distinguished Engineer ), where they are particularly concerned with security issues such as digital rights management or public surveillance. In the 1990s, she was also involved in the public debate on the question of the export of cryptographic software in the U.S.. Since then, she is a sought-after expert in the American public for security concerns around the Internet and in general for data security issues and also advised national authorities in Europe. She wrote, among others, for Scientific American, the Washington Post and the Boston Globe.

For many years she also taught mathematically gifted high school students in summer camps of the Hampshire College Summer Studies in Mathematics.

Landau is a Fellow of the American Association for the Advancement of Science and is a distinguished engineer of the Association for Computing Machinery (ACM ). It is in the advisory committees for computer security issues of the ACM and was six years in which the National Institute of Standards and Technology ( NIST). She is the main author of the ACM reports Codes, Keys and Conflicts: Issues in U.S. Crypto Policy of 1994.

It is committed to women in computer science, for example, when she founded REsearchers email list, in the bodies of the ACM ( where she initiated the Athena Lecture in honor for computer scientists ) and she is a member of the Computing Research Association Committee on the Status of Woman in computing Research ( CRAW )

It dealt with algorithm theory and symbolic computing. In 1989, she developed the first algorithm for deciding whether an expression of nested roots can be simplified and found polynomial - time algorithms for various problems for which previously only exponential - time algorithm was known.

She is co-editor of the Notices of the American Mathematical Society.

She is married and has two children.

Writings

  • With Whitfield Diffie Privacy on the Line - the Politics of wiretapping and encryption, MIT Press 1998, 2007
  • Understanding the test of time -the DES, Notices AMS 2000, Issue 3
  • Find me a hash, Notices AMS 2006, Issue 3
  • Communication Security in the 21st Century -the AES, Notices AMS 2000, Issue 4
Time complexity#Polynomial time
756222
de