Ueli Maurer (cryptographer)

Ueli Maurer (born 26 May 1960) is a professor of cryptography at the Swiss Federal Institute of Technology Zurich (ETH Zurich).

Ueli Maurer
Born (1960-05-26) 26 May 1960
Awards
Academic background
Alma materSwiss Federal Institute of Technology Zurich
ThesisProvable Security in Cryptography (1990)
Doctoral advisorJames Massey[1]
Academic work
DisciplineCryptography
InstitutionsSwiss Federal Institute of Technology Zurich
Doctoral students
Websitewww.crypto.ethz.ch/~maurer/

Maurer studied electrical engineering at ETH Zurich and obtained his PhD in 1990, advised by James Massey. Afterwards, he joined Princeton university as a postdoc. In 1992, he became part of the computer science faculty of ETH Zurich.

In a seminal work, he showed that the Diffie-Hellman problem is (under certain conditions) equivalent to solving the discrete log problem.[2]

From 2002 until 2008, Maurer also served on the board of Tamedia AG.[3]

Maurer is editor of the Journal of Cryptology and used to be editor-in-chief.

In 2008, Maurer was named a Fellow of the International Association for Cryptologic Research "for fundamental contributions to information-theoretic cryptography, service to the IACR, and sustained educational leadership in cryptology." [4] In 2015, he was named a Fellow of the Association for Computing Machinery "for contributions to cryptography and information security."[5] In 2016, he got the RSA Award for Excellence in Mathematics.

References

  1. Ueli Maurer at the Mathematics Genealogy Project
  2. Ueli Maurer: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Advances in Cryptology - Crypto '94. Springer-Verlag, 1994, S. 271−281.
  3. Tamedia AG Medienmitteilung 23. April 2008: Jahresabschluss 2007 Archived 2012-01-12 at the Wayback Machine
  4. "Ueli Maurer, IACR Fellow". www.iacr.org.
  5. ACM Fellows Named for Computing Innovations that Are Advancing Technology in the Digital Age, Association for Computing Machinery, 2015, archived from the original on 2015-12-09, retrieved 2015-12-09.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.