Joan Daemen

From Wikipedia, the free encyclopedia
Joan Daemen
Born1965 (age 55–56)
NationalityBelgian
Alma materKatholieke Universiteit Leuven
Known forRijndael, Keccak
Scientific career
FieldsCryptography
ThesisCipher and Hash Function Design. Strategies based on linear and differential cryptanalysis (1995)
Doctoral advisor

Joan Daemen (Dutch pronunciation: [joːˈɑn ˈdaːmə(n)]; born 1965) is a Belgian cryptographer who co-designed with Vincent Rijmen the Rijndael cipher, which was selected as the Advanced Encryption Standard (AES) in 2001.[1] More recently, he co-designed the Keccak cryptographic hash, which was selected as the new SHA-3 hash by NIST in October 2012. [2] He has also designed or co-designed the MMB, Square, SHARK, NOEKEON, 3-Way, and BaseKing block ciphers. In 2017 he won the Levchin Prize for Real World Cryptography "for the development of AES and SHA3".[3] He describes his development of encryption algorithms as creating the bricks which are needed to build the secure foundations online. [4]

In 1988, Daemen graduated in electro-mechanical engineering at the Katholieke Universiteit Leuven. He subsequently joined the COSIC research group, and has worked on the design and cryptanalysis of block ciphers, stream ciphers and cryptographic hash functions. Daemen completed his PhD in 1995, at which point he worked for a year at Janssen Pharmaceutica in Beerse, Belgium. He subsequently worked at the BACOB bank, , and then STMicroelectronics. Since 2015 Daemen has been professor at the Radboud University Nijmegen.[5]

References[]

  1. ^ "Announcing the ADVANCED ENCRYPTION STANDARD (AES)" (PDF). NIST Federal Information Processing Standards Publication 197. United States National Institute of Standards and Technology (NIST). November 26, 2001. Retrieved 2012-12-16.
  2. ^ Chad Boutin (2012-10-02). "NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition". NIST Tech Beat. United States National Institute of Standards and Technology (NIST). Retrieved 2012-12-16.
  3. ^ http://www.realworldcrypto.com/levchinprize
  4. ^ "Biography: Near-unbreakable algorithm protects almost all of your data". RedBound. November 26, 2001. Retrieved 2020-10-26.
  5. ^ "Nieuwsoverzicht".

External links[]


Retrieved from ""