Bacon Number: 5
I was in S01E04 Afzwemmen in the series Kinderen van waterland (proof!) with Frits Jansma who was in Het Zakmes with Genio De Groot who was in The Heineken Kidnapping with Rutger Hauer who was in Sin City with Elijah Wood who was in Beyond All Boundaries with Kevin Bacon.
I am a cryptographic researcher in the competence center crypto & security at NXP Semiconductors, Leuven, Belgium.
Previously, I was a post-doctoral researcher in the Cryptography Research Group at Microsoft Research, Redmond, USA. I obtained my PhD in the laboratory for cryptologic algorithms at EPFL, Lausanne, Switzerland under supervision of Prof. Arjen Lenstra in 2012.
My research focuses on computational number theory and high-performance arithmetic as used in (post-quantum) public-key cryptography. On the one hand, I have an interest in the various mathematical problems used in applied cryptography. Examples include the integer factorization problem and the (elliptic curve) discrete logarithm problem. On the other hand I like to investigate the different techniques to realize efficient cryptographic implementations on various exotic or embedded architectures.
Post-Quantum Cryptography Standardization: I am a submitter of three lattice-based submissionsRound 2.
[Update July 2020]: Kyber is one of the four remaining round 3 finalists in the category “Public-key Encryption and Key-establishment Algorithms” and FrodoKEM is one of the five alternate candidates of the NIST Post-Quantum Cryptography Standardization effort.
I serve(d) on the following program committees
- Transactions of CHES (TCHES): 2018, 2019, 2020
- Asiacrypt: 2017, 2021
- Eurocrypt: 2021
- Conference on Computer and Communications Security (CCS): 2021
- Conference on Post-Quantum Cryptography (PQCrypto): 2016, 2017, 2018
- Selected Areas in Cryptography (SAC) 2013, 2019
- RSA Conference Cryptographers’ Track (CT-RSA): 2018, 2019
- Conference on Cryptology in India (Indocrypt): 2017, 2021
- Latincrypt: 2017
- Workshop on the Arithmetic of Finite Fields: 2020
- Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC): 2019, 2020, 2021
- Workshop on Security for Embedded and Mobile Systems (SEMS) 2017
- Conference on Software performance enhancement for encryption and decryption, and benchmarking (SPEED-B): 2016
- Conference on ICT Systems Security and Privacy Protection (IFIP SEC): 2015, 2016, 2017
- Conference on Cryptography and Coding (IMA CC): 2013
- March 2021: It has been an honor to write about my supervisor, colleague and friend Peter Montgomery in AMS together with Kristin Lauter.
- July 2020: Kyber is one of the four remaining round 3 finalists in the category “Public-key Encryption and Key-establishment Algorithms” and FrodoKEM is one of the five alternate candidates of the NIST Post-Quantum Cryptography Standardization effort.
- January 2019: All three lattice-based submissions I am involved in made it to the second round of the NIST Post-Quantum Cryptography Standardization effort.
- November 2017: I am a submitter of three submissions to round 1 of the NIST Post-Quantum Cryptography Standardization effort.
- November 2016: I am honoured and excited to serve as the IACR secretary.
- July 2016: Our paper related to the security assessment of white-box cryptography received the best paper award at the CHES 2016 conference!
- May 2016: I am panel member at A Workshop About Cryptographic Standards (AWACS).
- September 2015: I participate in the panel discussion on the standardisation of elliptic curves for cryptographic use which was part of the Workshop on Elliptic Curve Cryptography.
- June 2015: I presented our hardware view on elliptic curves at NIST’s Workshop on Elliptic Curve Cryptography Standards and participated in the panel discussion related to ECC in industry.
- February 2014: My first Journal of Craptology appearance! [ Volume 9 ] [ lyrics ] [ youtube ]
- November 2013: We performed a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. [ blog ] [ paper ]
- February 2012: Our public-key sanity check paper titled Ron was wrong, Whit is right demonstrates that two out of every one thousand RSA moduli that we collected offer no security. [ NY times ] [ /. ]
- June 2011: A new factorization record: Largest factorization of a Cunningham number with the general number field sieve: C197 from 2,1196+ factors as P77 * P120.
- March 2010: We found a new ECM record factor of 73-digits on our PS3-cluster.
- January 2010: Factorization of a 768-bit RSA modulus: [ summary ] [ paper ] [ /. ]
- July 2009: A new ECDLP record. PlayStation 3 computing breaks 260 barrier: 112-bit prime ECDLP solved. [ summary ] [ paper ] [ /. ]
- June 2009: A new factorization record. Largest factorization of a Cunningham number with the general number field sieve: C182 from 2,1157- factors as P91 * P92.