Gerhard Frey is Professor at the University of Duisburg-Essen's Institute for Experimental Mathematics, holding the honorary title Prof. Dr. Dr. h.c. His research bridges arithmetic geometry and cryptographic applications. Research focuses on algebraic curves, abelian varieties, and their use in public-key cryptosystems. This includes work on discrete logarithm problems, isogenies, and security protocols based on number-theoretic constructs.
Christelle Vincent is an Associate Professor in the Department of Mathematics and Statistics at the University of Vermont, where she contributes to research and teaching in number theory, arithmetic geometry, and mathematical cryptography. She co-organizes the Connecticut Summer School in Number Theory and previously co-founded the Math Summer Program for Inclusive Excellence (SPIE), now on hiatus. Ph.D. in Mathematics, University of Wisconsin–Madison Her research focuses on computational number theory, including contributions to the LMFDB and SageMath. She emphasizes applications to cryptography, particularly in isogeny-based systems and modular invariants. Recent publications highlight topics like supersingular elliptic curves, abelian varieties over finite fields, and privacy-preserving algorithms. Teaching interests include noncoercive teaching techniques and universal design to create inclusive, joyful classroom environments. She has taught courses ranging from calculus to advanced abstract algebra and cryptography, prioritizing accessibility and student well-being. Travel Grant for Mathematicians from the Simons Foundation She advises Ph.D. students Anton Hilado and Holly Paige Chaos in Mathematics and Statistics and co-advises Krystal Maughan in Computer Sciences. Her service work includes organizing workshops like Rethinking Number Theory, aiming to center historically excluded voices in mathematics.
Jean-François Biasse is Professor in the Department of Mathematics & Statistics at University of South Florida and Director of the Center for Cryptographic Research. His research specializes in computational number theory and post-quantum cryptography, particularly lattice-based and isogeny-based cryptographic schemes. He holds a PhD from École Polytechnique and has held positions at University of Waterloo and University of Calgary. His research develops: Algorithms for class group and unit group computation Cryptanalysis of post-quantum schemes Quantum-resistant cryptographic protocols Efficient implementations of number-theoretic algorithms He has contributed significantly to isogeny-based cryptanalysis. His publications address: Quantum attacks on cryptographic assumptions Subexponential algorithms in number theory Security of code-based signatures Ideal lattice problems in cyclotomic fields Recent work examines tradeoffs between classical and quantum attacks. Dr. Biasse leads research on privacy-preserving technologies through projects like Trace- and homomorphic encryption systems. He serves as associate editor for the International Journal of Computer Mathematics: Computer Systems Theory.
Sorina Ionica is a Lecturer at the University of Picardie Jules Verne, specializing in Cryptography , Mathematics , and Artificial Intelligence . Her research focuses on the application of optimization techniques and algebraic geometry to cryptographic protocols, particularly in the context of genus 3 curves and isogeny-based cryptography. Research Interests: Cryptography, isogeny graphs, complex multiplication, index calculus, and AI-driven optimization algorithms. Projects: Involved in BforSAT (application of SAT solvers to cryptographic problems) and POSTCRYPTUM (post-quantum cryptography research). Recent Articles: Her work spans mathematical cryptography (e.g., CM curves and Weil descent attacks), algorithm optimization (Crossbred algorithm), and AI integration in cryptanalysis (tree search and SAT solvers). Labs: Sorina is affiliated with the OCIA Lab (Optimization and Cryptography, AI).
Peter Bruin is an Assistant Professor at the Mathematical Institute of Leiden University, specializing in algebra, geometry, and number theory. He is affiliated with the Quantum Software Consortium, an NWO Gravitation project, and the ALGANT Organisation. His research focuses on concrete arithmetic between geometry and number theory, with particular interest in elliptic curves, Galois representations, and modular forms. Peter Bruin completed his PhD at Universiteit Leiden in 2010 with the thesis "Modular curves, Arakelov theory, algorithmic applications" under the supervision of Prof. dr. S. J. Edixhoven and Dr. R. S. de Jong. Prior to that, he earned his Master's degree from the same institution in 2006 with the thesis "Green functions on Riemann surfaces and an application to Arakelov theory." His academic journey includes postdoctoral positions at Université Paris-Sud 11, Institut des Hautes Études Scientifiques, Universität Zürich, and the University of Warwick, where he served as an Assistant Professor (Warwick Zeeman Lecturer). Bruin's research interests lie at the intersection of algebraic geometry and number theory, with particular focus on elliptic curves, Galois representations, modular forms, and arithmetic geometry. His work often involves developing computational methods and software tools to explore theoretical questions in these areas. He has made significant contributions to understanding torsion structures of elliptic curves, L-functions, and the connections between modular curves and number fields. His research has applications in cryptography, particularly in lattice-based and post-quantum cryptographic systems. His recent publications demonstrate a strong focus on the arithmetic properties of elliptic curves and their generalizations, with particular attention to torsion structures, modular curves, and the computational aspects of Galois representations. His work spans both theoretical developments and practical implementations, as evidenced by his creation of specialized mathematical software packages. Organized "An Expedition into Arithmetic Geometry" (2023) in memory of Bas Edixhoven Co-organized COUNT workshop (2023) on computations in number theory Organized 6th General Assembly of Quantum Software Consortium (2021) Organized Algorithms in Number Theory and Arithmetic Geometry workshop (2017) As an educator, Bruin teaches a variety of courses including Linear Algebra, Topology, Modular Forms, and Representation Theory of Finite Groups. He also leads seminars on presenting and communicating mathematical concepts. His teaching philosophy emphasizes connecting theoretical concepts with practical applications, particularly in the emerging field of quantum computing.
Elena Kirshanova is a part-time Lecturer at I.Kant Baltic Federal University and Lead Cryptographer at Technology Innovation Institute. Her research focuses on practical and theoretical cryptanalysis of lattice-based and code-based cryptographic primitives, with applications to post-quantum security. Research interests include: Lattice-based cryptanalysis Quantum algorithms for cryptographic problems Decoding attacks on McEliece variants Sieving techniques for codes and lattices She teaches courses in lattice-based cryptography, coding theory, and information security. Dr. Kirshanova serves on program committees for major cryptography conferences including Crypto, Eurocrypt, and PQCrypto. Her work bridges theoretical cryptanalysis with practical implementations for post-quantum cryptographic schemes.
James T Clements is a Doctor of Philosophy affiliated with the School of Computer Science at the University of Bristol and a member of the Bristol Doctoral College. His research focuses on advanced cryptographic methods and mathematical structures in computer science. Recent work includes contributions to supersingular isogeny-based cryptography , such as analyzing cycles and cuts in L-isogeny graphs and parametrizing maximal orders along isogeny paths. These studies intersect cryptology, graph theory, and algebraic geometry. Collaborations and research outputs (2) highlight his expertise in quantum-resistant cryptographic systems and mathematical foundations of secure computing. No scientific awards or student advisement information are explicitly listed in the provided data.
Alexander May is a Professor at Ruhr-University Bochum, affiliated with the Faculty of Mathematics and the Horst Görtz Institute for IT-Security. His research focuses on cryptanalysis, post-quantum cryptography, and lattice-based security, with extensive work on cryptographic attacks targeting schemes like LWE, NTRU, McEliece, and RSA. Research Interests: May specializes in: Developing optimized attacks on lattice-based cryptosystems (e.g., Kyber, Dilithium) Side-channel vulnerability analysis in post-quantum schemes Quantum algorithm applications in cryptanalysis Efficient decoding attacks for code-based cryptography His recent publications (2021-2025) demonstrate consistent focus on: Practical cryptanalysis with reduced computational resources Novel approaches to breaking NIST post-quantum candidates Quantum-speedup techniques for key recovery Side-channel attacks on hardware implementations PhD Supervision: May has supervised over 15 doctoral students including recent graduates like Carl Schneider (2024), Önder Askin (2024), and Floyd Zweydinger (2023). Their work spans lattice cryptography, coding theory, and quantum cryptanalysis.
Simon-Philipp Merz is a Research Fellow in the Applied Cryptography Group at ETH Zurich. His research focuses on post-quantum cryptography with specialization in cryptanalysis of isogeny-based systems. He currently holds fellowships from the German Research Foundation (DFG) and Zurich Information Security Center (ZISC). His work examines security assumptions underlying cryptographic protocols, developing both attacks and defenses for next-generation systems. Recent publications analyze vulnerabilities in content-defined chunking systems and improve isogeny computation algorithms. He maintains active collaborations with IBM Research Zurich and academic partners internationally.
Ross Bowden is a Lecturer in Cryptography at the School of Computer Science, University of Bristol. His research focuses on mathematical foundations of cryptography, including endomorphism, hash functions, polynomial systems, and graph theory. He is affiliated with the Bristol Doctoral College. Research interests: His work intersects computer science and mathematics, particularly in cryptographic hash functions, polynomial equation systems, and supersingular isogeny graphs. His recent publications address open problems in these domains. Publications: Active in advancing cryptographic algorithms and mathematical structures, with contributions to supersingular isogeny graphs and polynomial-based cryptographic challenges. Contact: Email ross.bowden@bristol.ac.uk or rb15152@bristol.ac.uk .
Wissam Ghantous is an Assistant Professor in the Department of Mathematics at the University of Central Florida and a member of UCF's Cyber Security and Privacy Cluster. His research focuses on post-quantum cryptography and computational number theory. Prior to his current role, he was a postdoctoral researcher at École Normale Supérieure (Paris) and completed his PhD at the University of Oxford in 2023. Education: PhD in Mathematics, University of Oxford (2023) Postdoctoral Researcher, École Normale Supérieure, Paris (2022–2024) His research interests include isogeny-based cryptography, modular forms, and algorithmic number theory. He actively participates in international conferences, including the 2025 AMS Sectional Meeting, Darmonfest, and LMFDB, Computation, and Number Theory (LuCaNT). He has presented at venues such as MIT, Harvard, and ETH Zürich. Grants and Advising: No explicit grants or student advisement listed. He contributes to the Cyber Security and Privacy Cluster at UCF, focusing on cryptographic protocols resilient to quantum computing advancements.
Diana Mocanu is a postdoctoral researcher at the Max Planck Institute for Mathematics in Bonn. Previously, she completed her PhD at the University of Warwick under Prof. Samir Siksek, focusing on Diophantine equations over totally real fields using modular forms and S-unit equations. She holds an MMath from the University of Oxford, where her dissertation explored profinite groups as Galois groups. Research Interests: Modular method for Diophantine equations Galois representations and elliptic curves Arithmetic geometry Hyperelliptic curves and isogeny-based cryptography Her work bridges number theory and cryptography, with recent publications on conductor exponents for hyperelliptic curves and asymptotic Fermat equations. Mocanu has presented at major conferences such as BIRS Modern Breakthroughs in Diophantine Problems and the Ukraine Algebra Conference. She actively organizes events like WINGs 2023 (Women in Number Theory and Geometry) and co-leads the Isogeny-based Cryptography Study Group at Warwick. Teaching & Service: Teaching assistant for advanced modules (Galois Theory, Modularity, Reflection Groups) and undergraduate supervisor at the University of Warwick. She also served as President of the Oxford University Mathematics Society (Invariants).
Prof. Dr. Gregor Leander is a Professor and Head of the Symmetric Cryptography chair at Ruhr-University Bochum, Faculty of Computer Science. He is a leading researcher in the field of symmetric cryptography with significant contributions to both theoretical foundations and practical applications of cryptographic primitives. Professor Leander has an extensive background in mathematics with a PhD focused on theoretical aspects of Boolean functions. His research spans the entire spectrum of symmetric cryptography, from fundamental theoretical questions to practical implementations deployed in real-world applications. He has been instrumental in designing ciphers that have seen widespread deployment, as well as analyzing and improving existing cryptographic standards. Created the symmetric cryptography group at Ruhr University Bochum in 2015 Founder and managing editor of the IACR Transaction of Symmetric Cryptography journal Active participant in numerous prestigious conferences as program co-chair, organizer, and invited speaker Professor Leander's research interests primarily focus on symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, and cryptographic hash functions. His work bridges the gap between theoretical cryptography and practical security requirements, with particular emphasis on lightweight cryptography for constrained environments. He has made significant contributions to understanding the mathematical foundations of cryptographic primitives while ensuring their practical applicability in real-world systems. His recent publications demonstrate a continued focus on foundational aspects of symmetric cryptography while expanding into post-quantum cryptography and the intersection of symmetric and asymmetric cryptographic techniques. The research output shows a consistent pattern of addressing both theoretical challenges and practical implementation concerns, with many contributions becoming international standards. Scientific Awards and Recognition 2022: SKINNY is ISO standard (ISO/IEC 18033-7) as a Tweakable Block Cipher 2020: IACR CRYPTO 2020, Best Paper Award and invitation to Journal of Cryptology 2015: Heisenberg Professorship, a prestigious funding line for upcoming leaders by the DFG 2014: IACR FSE 2014, Best Paper Award and invitation to Journal of Cryptology 2010: PRESENT is ISO standard (ISO/IEC 29192-2) for Lightweight Cryptography 2010: German IT Security Award (worth 100kEUR), first place 2011: Erdos Number 2 Professor Leander has successfully advised numerous PhD students who have gone on to make their own contributions to the field of cryptography. His group at Ruhr-University Bochum has received significant research funding, including the prestigious Heisenberg Professorship from the DFG. He has been actively involved in organizing major cryptographic conferences and workshops, contributing to the advancement of the field through community building and knowledge sharing. The symmetric cryptography group at Ruhr-University Bochum, which Professor Leander founded in 2015, has become a renowned center for cryptographic research. The group maintains strong collaborations with other leading research institutions worldwide and regularly hosts visiting researchers. Through the IACR Transaction of Symmetric Cryptography journal, which Professor Leander founded, the group has also established a significant platform for high-quality research publication in the field.
Dr. Michael Reichle is a Researcher at the Department of Computer Science, ETH Zürich, Switzerland. His work focuses on advanced cryptographic protocols, with particular emphasis on threshold signatures, blind signatures, and privacy-preserving technologies. He is affiliated with the Professur für Informatik (Computer Science Professorship) and contributes to cutting-edge research in cryptography and information security. Reichle's research interests include lattice-based cryptography, cryptographic protocol design, and secure computation. His recent work explores efficient blind signature schemes, cryptanalysis of isogeny-based systems, and forward-secure searchable encryption. His publications span topics like threshold cryptography, zero-knowledge proofs, and privacy-preserving authentication mechanisms. He has developed innovative cryptographic primitives such as Hermes for I/O-efficient searchable encryption and the TRaccoon threshold signature framework. His contributions emphasize practicality and security under standard assumptions, often avoiding reliance on cryptographic pairings or complex algebraic structures. No scientific awards or grants are explicitly mentioned in the provided texts. His contact information includes an email address at ETH Zurich's Computer Science Institute.
Benjamin Wesolowski is a CNRS researcher (chargé de recherche) at the Unité de Mathématiques pures et appliquées (UMPA), École Normale Supérieure de Lyon (ENS Lyon), France. He previously held a CNRS researcher position at the Institut de Mathématiques de Bordeaux (IMB) and completed postdoctoral work at Centrum Wiskunde en Informatica (CWI) in the Netherlands. His research lies at the intersection of mathematics and cryptography, particularly in number theory and algebraic geometry. PhD, EPFL (2018) Master’s in Mathematics, EPFL (2014) Bachelor’s in Mathematics, EPFL (2012) Habilitation (HDR), ENS Lyon (2024) His research focuses on cryptologic algorithms rooted in number theory and algebraic geometry, especially isogeny-based cryptography , post-quantum signatures , and verifiable delay functions . He explores the structure of isogeny graphs of abelian varieties and their applications to blockchain and randomness generation. His work combines deep theoretical mathematics with practical cryptographic design. The most recent articles highlight a consistent trend in isogeny-based cryptography , particularly in constructing compact and secure post-quantum signature schemes like SQISign and PRISM. His contributions also extend to cryptanalysis, as seen in the key recovery attack on SIDH, and foundational work on verifiable delay functions. These works span top-tier venues such as Eurocrypt, Asiacrypt, and PKC, reflecting his leadership in advancing both theoretical and applied aspects of modern cryptography. CNRS 2025 Bronze Medal ERC Starting Grant AGATHA CRYPTY (2023) Secretary of the IACR (elected, 2023) Best paper award PKC 2025 Best paper award Eurocrypt 2024 Top-3 paper Eurocrypt 2023 Best paper award Asiacrypt 2020 Best young researcher paper Eurocrypt 2019 Benjamin Wesolowski has been supported by competitive grants including the ERC Starting Grant AGATHA CRYPTY . He has advised students during his tenure at EPFL as a teaching assistant and likely through doctoral supervision, though specific advisees are not listed. His academic service includes being elected Secretary of the IACR , a major recognition in the cryptology community. He has also received fellowships such as the Doctoral EDIC Fellowship and prizes including the Kudelski Prize and EPFL Prize . His research is conducted primarily within the Unité de Mathématiques pures et appliquées (UMPA) at ENS Lyon, a leading center for mathematical research in France. He was part of the Cryptology Group at CWI under Ronald Cramer during his postdoc and has collaborated extensively with institutions such as EPFL, UC Berkeley, and IMB. His work often bridges theoretical mathematics and practical cryptographic implementation.
