On the passive compromise of TLS keys and other cryptanalytic adventures, by Nadia Heninger
Hard problems for isogeny-based cryptography, by Benjamin Wesolowski
Efficient key recovery attacks on SIDH, by Wouter Castryck
Nadia Heninger is an associate professor in Computer Science and Engineering at the University of California, San Diego. Her research focuses on applied cryptography and security, particularly cryptanalysis of public-key cryptography in practice. She is the recipient of a 2017 NSF CAREER award, and her research has won best paper awards at CCS 2016, CCS 2015, Usenix Security 2012, and a best student paper award at Usenix Security 2008. Previously, she was an assistant professor at the University of Pennsylvania. She received her Ph.D. in computer science in 2011 from Princeton and spent time as a postdoc at UC San Diego and Microsoft Research New England.
Benjamin Wesolowski is a CNRS researcher at the Institut de Mathématiques de Bordeaux (IMB, France). His research focuses on cryptologic algorithms related to number theory and algebraic geometry. He has contributed to the design or cryptanalysis of schemes based on isogenies, lattices, and discrete logarithms in finite fields.
Benjamin obtained his PhD in 2018 at the École Polytechnique Fédérale de Lausanne (EPFL, Switzerland) on arithmetic and geometric structures in public key cryptography. He joined his current position after a post-doc at the Cryptology Group of the Centrum Wiskunde & Informatica (CWI, The Netherlands).
Wouter Castryck is currently working as a research expert in the research group COSIC of the Department of Electrical Engineering at KU Leuven. On a voluntary basis, he is also affiliated with the Department of Mathematics: Algebra and Geometry at Ghent University. His research interests include algebraic curves, curve-based cryptography, lattice-based cryptography, toric geometry, combinatorics of lattice polytopes.