This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) This biography of a living person needs additional citations for verification. Please help by adding reliable sources. Contentious material about living persons that is unsourced or poorly sourced must be removed immediately from the article and its talk page, especially if potentially libelous.Find sources: "Stefan Lucks" – news · newspapers · books · scholar · JSTOR (October 2017) (Learn how and when to remove this template message) This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help to improve this article by introducing more precise citations. (October 2017) (Learn how and when to remove this template message) (Learn how and when to remove this template message)
Stefan Lucks
Born (1964-05-10) 10 May 1964 (age 59)
NationalityGerman
Alma materUniversity of Göttingen
Known forattacks on Triple DES, AES, LEVIATHAN, and E0
Scientific career
FieldsComputer science
InstitutionsBauhaus University, Weimar
ThesisSystematische Entwurfsmethoden für praktikable Kryptosysteme (1997)
Doctoral advisorStephan Waack
Websitewww.uni-weimar.de

Stefan Lucks is a researcher in the fields of communications security and cryptography. Lucks is known for his attack on Triple DES, and for extending Lars Knudsen's Square attack to Twofish, a cipher outside the Square family, thus generalising the attack into integral cryptanalysis. He has also co-authored attacks on AES, LEVIATHAN, and the E0 cipher used in Bluetooth devices, as well as publishing strong password-based key agreement schemes.

Lucks graduated from the University of Dortmund in 1992, and received his PhD at the University of Göttingen in 1997. After leaving the University of Mannheim Lucks now heads the Chair of Media Security at Bauhaus University, Weimar.

Together with Niels Ferguson, Bruce Schneier and others he developed the Skein hash function as a candidate for the NIST hash function competition.