Claus P. Schnorr
C.-P. Schnorr at Oberwolfach, 1986.
|Born||August 4, 1943|
|Known for||Schnorr group|
|Awards||Gottfried Wilhelm Leibniz Prize|
|Institutions||Johann Wolfgang Goethe University|
|Doctoral advisor||Günter Hotz|
He received his Ph.D. from the University of Saarbrücken in 1966, and his habilitation in 1970. Schnorr's contributions to cryptography include his study of Schnorr groups, which are used in the digital signature algorithm bearing his name. Besides this, Schnorr is known for his contributions to algorithmic information theory and for creating an approach to the definition of an algorithmically random sequence which is alternative to the concept of Martin-Löf randomness.
Schnorr was a professor of mathematics and computer science at the Johann Wolfgang Goethe university at Frankfurt. He retired in 2011 after working there for 40 years. He is also a Distinguished Associate of RSA Laboratories, and a joint recipient of the Gottfried Wilhelm Leibniz Prize together with Johannes Buchmann in 1993. He received, with Jean-Jacques Quisquater, the RSA Award for Excellence in Mathematics in 2013.
Schnorr held a patent on Schnorr signatures until 2008.
|This article about a German mathematician is a stub. You can help Wikipedia by expanding it.|
|P ≟ NP||This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.|