This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
en:group:members:lorenz [2009/04/02 10:56] admin |
en:group:members:lorenz [2016/06/23 11:26] (current) |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | {{ :en:group:members:rimg_lorenz1.jpg|Lorenz}} | ||
+ | |||
+ | Lorenz studied mathematics at EPFL, and obtained his diploma in March 2003, | ||
+ | which was directed by | ||
+ | [[http://sprsg1.epfl.ch/research/Webdriver?MIval=ADP_CV_PROF&PersId=362&MIlang_env=1|Prof. Bayer]]. | ||
+ | |||
+ | Lorenz finished his PhD at LMA in July 2007. His work centered around attacks | ||
+ | on various public-key crycptosystems based on error-correcting codes. He will | ||
+ | be joining the faculty of Computer Science of UC Berkeley as a Post-Doc funded | ||
+ | by the Swiss National Fund in February 2008. | ||
+ | |||
+ | More current and detailed information can be found on | ||
+ | his [[http://www.eecs.berkeley.edu/~lorenz|personal page]]. | ||
+ | |||
---- dataentry member ---- | ---- dataentry member ---- | ||
title : Dr. | title : Dr. | ||
Line 8: | Line 22: | ||
position : Post-Doc | position : Post-Doc | ||
listgroup : d | listgroup : d | ||
- | status : past | + | state : past |
- | lefton_date: 2007-12-31 | + | left_dt: 2007-12-31 |
table : members | table : members | ||
summary : Lorenz finished his PhD at ALGO in 2007 specializing in code-based cryptography. Specifically, he analyzed different families of algebraic codes for their structural security. For example, he discovered the first known effective attacks against the Sidelnikov-cryptosystem, and he generalized the Sidelnikov-Shestakov-attack on the Niederreiter-cryptosystem to apply also to algebraic-geometry codes based on elliptic curves. | summary : Lorenz finished his PhD at ALGO in 2007 specializing in code-based cryptography. Specifically, he analyzed different families of algebraic codes for their structural security. For example, he discovered the first known effective attacks against the Sidelnikov-cryptosystem, and he generalized the Sidelnikov-Shestakov-attack on the Niederreiter-cryptosystem to apply also to algebraic-geometry codes based on elliptic curves. | ||
---- | ---- | ||
- | |||
- | ciao |