Find Academic Supervisors

• Zero-Knowledge Proofs
• Lattice-Based Cryptography
• Error-Correcting Codes
• +3 more

Jonathan Bootle is a cryptography researcher in the Foundational Cryptography group at IBM Research – Zurich , specializing in efficient zero-knowledge proofs. He holds a PhD from University College London and a Mathematics degree from Clare College, University of Cambridge . Education : PhD (UCL), Mathematics (Part III, Cambridge) His research focuses on zero-knowledge proofs , lattice-based cryptography , and error-correcting codes , with applications in post-quantum security. Recent work includes formal verification of protocols, elastic SNARKs, and generalized key exchange mechanisms. Key publication trends: 2024: Formal verification of sumcheck protocol 2023: Lattice-based credentials and succinct arguments 2022: Gemini SNARKs and DualDory linkable signatures He teaches the 2024 ETH Zurich course on Zero-Knowledge Proofs , covering sigma protocols, Fiat-Shamir transformations, and polynomial commitments. Labs/Teams: Foundational Cryptography group, IBM Security Department Collaborations with UC Berkeley (Alessandro Chiesa) and UCL (Jens Groth)

Sihem MesnagerView profile

Professor

• Symmetric Cryptography
• Coding Theory
• Finite Fields
• +10 more

Sihem Mesnager is a University Professor of Mathematics at the University of Paris VIII, affiliated with the Laboratory of Analysis, Geometry and Applications (LAGA) at Paris XIII (CNRS) and the AGC3 research group (Algebra, Geometry, Combinatorics) . She holds an adjunct professorship at Télécom Paris within the MIC2 Mathematics team of the Computer Science and Networks department (INFRES). Her work bridges pure mathematics and applied cryptography, focusing on Boolean functions, bent functions, and coding theory for secure communication and data protection. PhD in Mathematics, University of Pierre and Marie Curie (Paris VI), Sorbonne University (2002) Habilitation (HDR) in Mathematics, University of Paris VIII (2012) Research Interests Dr. Mesnager specializes in symmetric cryptography and coding theory , particularly their applications to secure digital communication, error correction, and post-quantum cryptographic protocols. Her algebraic approach employs finite fields, exponential sums, algebraic geometry, and finite geometry to analyze and construct cryptographic primitives like S-boxes, APN functions, and optimal linear codes. She also investigates algorithmic aspects of computer algebra in these domains. Scientific Awards George Boole International Prize (2020) PEDR Excellence Scientific Award (2019-2022) PEDR Excellence Scientific Award (2014-2017) Publications & Projects Her recent work includes constructing weightwise perfectly balanced Boolean functions for the FLIP cipher, optimizing Inner Product Masking schemes via coding theory, and developing post-quantum secure functional encryption using multivariate cryptography. She has contributed to Reed-Muller codes, BCH codes, and Gaussian sum-based linear codes with one-dimensional hulls, emphasizing their applications in side-channel attack resistance and quantum error correction.

Dimitar JetchevView profile

Professor

• Number Theory
• Arithmetic Geometry
• Mathematical Cryptology
• +2 more

Dimitar Jetchev is a Swiss National Science Foundation Professor in number theory, arithmetic algebraic geometry, and mathematical cryptology at the School of Basic Sciences, EPFL. He leads the GR-JET research group and holds positions in the Mathematics Section (TAN) and SMA-GE unit. University of California at Berkeley, Ph.D. in Mathematics (2008) Harvard University, B.A. in Mathematics (2004) Jetchev's research spans number theory and cryptography, focusing on elliptic curves, Selmer groups, Euler systems, Heegner points, and complexity analysis of cryptologic algorithms. His work bridges pure mathematics and cryptographic applications like ECC and symmetric key protocols. His recent publications analyze isogeny graphs of abelian varieties, discrete logarithm problems in genus 2, equidistribution phenomena, and Euler systems. These works explore connections between automorphic representations, unitary groups, and cryptologic algorithms. Swiss National Science Foundation Professor Jetchev has advised PhD students including Boumasmoud Mohamed Réda, Dudeanu Alina, and Vuille Marius Lorenz. His research group GR-JET collaborates with institutions like IHES and EPFL's LACAL lab. He works on unitary Shimura varieties, special cycles, and their applications to Iwasawa theory and the Bloch-Kato conjecture. The GR-JET group investigates isogeny-based cryptosystems and algorithmic improvements in discrete logarithm computations.

Siamak ShahandashtiView profile

Senior Lecturer

• Cyber Security
• Privacy-Enhancing Technologies
• Applied Cryptography
• +4 more

Dr. Siamak Shahandashti is a Senior Lecturer in the Department of Computer Science at the University of York, UK. He leads the Cyber Security & Privacy Research Group and is actively involved in academic governance roles including Chair of the Physical Sciences Ethics Committee and Programme Lead for the MSc Cyber Security programme. His research focuses on applied cryptography, privacy-preserving technologies, electronic voting systems, and blockchain applications. He holds a PhD in Computer Science and has contributed to over 40 peer-reviewed publications. Education: PhD in Computer Science, MSc in Telecommunications Engineering, BSc in Electrical Engineering. Professional qualifications include a PGCert in Academic Practice. Research interests span cyber security fundamentals, usable security mechanisms, and the intersection of cryptography with real-world systems. Notable projects include verifiable electronic voting systems and DoS-resilient blockchain protocols. He has led funded projects on e-voting scalability and contributed to standards reviews for ISO/IEC protocols. Award-winning educator in cyber security curriculum development, with active roles in admissions and academic ethics compliance. His work bridges theoretical cryptography with practical implementations, emphasizing user-centric security design principles. Labs/Teams: Cyber Security & Privacy Research Group (lead), Departmental Ethics Team (lead). Collaborations include institutions in Australia, France, and across Europe.

Phong NguyenView profile

Research Professor

• Cryptography
• Cryptanalysis
• Post-quantum Cryptography
• +5 more

Phong Nguyen is a Research Professor at Inria (Directeur de recherche) and a part-time professor at the Computer Science Department (DI ENS) of École Normale Supérieure (ENS), PSL University in Paris. He leads the ENS Crypto Team (Inria Equipe Projet Cascade) and serves as the principal investigator for the ERC Advanced Grant PARQ (2020) focused on lattices in parallel and quantum computing. He holds a PhD (1999) and Habilitation (2007) from ENS-Lyon, with an agrégation de mathématiques (1997). His research integrates cryptography, algorithmic number theory, and lattice-based computations, emphasizing: Cryptanalysis : Deconstructing cryptographic protocols, especially lattice-based systems Post-quantum cryptography : Developing quantum-resistant solutions Lattice algorithms : Optimization of reduction, enumeration, and sieving techniques Real-world applications : Bridging theoretical constructs with practical security implementations His publications (spanning Eurocrypt, Asiacrypt, and Journal of Cryptology) demonstrate deep expertise in lattice cryptography, with recurring themes in algorithm efficiency, cryptanalysis of NTRU/GGH systems, and theoretical advancements in lattice reduction. Recent work (2024) continues this trajectory with improved BKZ analysis and hypercubic lattice optimizations. Awards include : ERC Advanced Grant (2020) for PARQ project Best Paper Award at EUROCRYPT 2006 Cor Baayen Award (2001) He advises PhD students (e.g., Henry Bambury, Leo Ducas) and interns from institutions like École Polytechnique and ENS. He directs the ENS Crypto Team and previously held leadership roles as: French Director of the Japanese-French Laboratory for Informatics (2015-2019) European Director of LIAMA (Sino-European Computer Science Lab, 2013-2015) Coordinator of ECRYPT II virtual labs (2008-2012)

Julian LossView profile

Professor

• Cryptography
• Distributed Computing
• Provable Security
• +3 more

Dr. Julian Loss is a tenured faculty member at the CISPA Helmholtz Center for Information Security since 2021, focusing on cryptography and its interplay with distributed computing . He previously held postdoctoral positions at the University of Maryland (2019-2021) and Carnegie Mellon University (2021), and worked as a researcher at the blockchain company Spacemesh (2018-2021). Education : PhD in Mathematics from Ruhr University Bochum (2019) His research explores provable security , with emphasis on digital signature schemes , distributed consensus algorithms , and cryptographic protocol design . Recent publications address topics like kryptographic attacks , Byzantine agreement efficiency , and privacy analysis in cryptocurrencies . He has received the ERC Starting Grant (2023) and DFG Grant (2022) . His work is primarily published in top venues including PKC , CCS , EUROCRYPT , and IEEE S&P .

Anna-Lena HorlemannView profile

Associate Professor

• Algebraic Coding Theory
• Post-Quantum Cryptography
• Network Coding Theory
• +3 more

Anna-Lena Horlemann is an Associate Professor for Foundations of Computation at the School of Computer Science, University of St. Gallen. Her research focuses on algebraic coding theory, post-quantum cryptography, and network coding. She leads the Coding Theory and Cryptography research group, actively contributing to NIST's post-quantum standardization efforts. Her work addresses quantum computing threats to current cryptosystems and develops error-correcting codes for reliable data transmission and storage. Education: PhD in Mathematics from the University of Zurich (2013), supervised by Prof. Joachim Rosenthal. Diploma in Mathematics from Ruhr-Universität Bochum. Research interests span coding theory (e.g., rank-metric codes, subspace codes), cryptography (code-based systems, privacy protocols), and neuroinformatics (connectome analysis). Recent publications emphasize Lee metric applications, MDS code classification, and cryptanalysis of Gabidulin-based systems. She mentors doctoral researchers such as Nadja Willenborg and Violetta Weger, focusing on topics like code densities and quantum-resistant algorithms. Her team's work bridges theoretical foundations and practical implementations, with contributions to error-correction resilience and cryptographic security in post-quantum scenarios. No formal awards listed, but actively participates in international conferences (IEEE, CBCrypto) and journal reviews.

• Cryptography
• Elliptic Curve Cryptography
• Public-Key Cryptosystems
• +5 more

Dr. Chloe Martindale is a Senior Lecturer at the University of Bristol , affiliated with the School of Computer Science . Her research focuses on cryptography, particularly in isogeny-based systems, public-key cryptosystems, and computational mathematics. Her recent work includes parametrizing maximal orders along supersingular isogeny paths and analyzing attacks on the SIDH protocol. She has contributed to homomorphic encryption security using abelian groups. Scientific Awards Best Paper Honorable Mention (2023) Dutch Cyber Security Research Paper Award (2019)

Jonathan A. KelnerView profile

Professor

• Algorithms
• Complexity Theory
• Spectral Graph Theory
• +4 more

Jonathan A. Kelner is a Professor of Applied Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) . His research bridges pure mathematics and algorithms, focusing on spectral graph theory, combinatorial optimization, and distributed computing.

• Cryptography
• Lattice-based cryptography
• Post-quantum cryptography
• +3 more

Professor Damien Stehlé is a faculty member at École Normale Supérieure de Lyon (ENS Lyon), where he is part of the AriC team within the Laboratoire de l'Informatique du Parallélisme (LIP). He is also a distinguished member of the Institut Universitaire de France. His research and teaching activities focus on cryptography, computational number theory, and computer algebra, with particular emphasis on lattice-based cryptographic systems. Stehlé's research primarily centers on the computational aspects of Euclidean lattices and their applications in cryptography. He has made significant contributions to lattice-based cryptography, particularly in the context of post-quantum cryptography. His work addresses fundamental questions about the hardness of lattice problems, algorithmic improvements for lattice reduction, and the development of practical cryptographic schemes based on lattice assumptions. He has been actively involved in the NIST post-quantum cryptography standardization process, contributing to the analysis of lattice-based candidates like Kyber and Saber. His publications span theoretical foundations to practical implementations, demonstrating a rare ability to bridge abstract mathematics with real-world cryptographic applications. Throughout his career, Stehlé has published extensively in top-tier cryptography and theoretical computer science venues. His research has been recognized with multiple best paper awards for groundbreaking contributions to the field. Best paper award at ASIACRYPT 2021 for 'On the hardness of the NTRU problem' Best paper award at ASIACRYPT 2015 for 'Improved security proofs in lattice-based cryptography' Best paper award at EUROCRYPT 2015 for 'Cryptanalysis of the Multilinear Map over the Integers' Professor Stehlé has supervised numerous PhD students over the years, often collaborating with other leading researchers in the field. He serves on program committees of major cryptography conferences and is a member of editorial boards for prestigious journals including the Journal of Cryptology and Designs, Codes and Cryptography. His research group at LIP's AriC team is recognized as a leading center for lattice-based cryptography research in Europe.

Elmar TeuflView profile

Senior Lecturer

• Random Walks on Graphs
• Combinatorics
• Probability Theory
• +3 more

Elmar Teufl is a Senior Lecturer in the Department of Mathematics at Eberhard Karls Universität Tübingen. He holds a Doctorate (2002) and a Habilitation (2015) from Graz University of Technology and Tübingen University, respectively. His research focuses on random walks on graphs and groups, combinatorial problems on self-similar structures, asymptotic methods, and fractal geometry. His work bridges probability theory, combinatorics, and graph theory with applications to fractal networks and recursive systems. Teufl has held academic positions across Europe, including visiting professorships at the University of Stuttgart (2012–2013) and a Marie Curie Fellowship at Bielefeld University (2005–2006). His research has been supported by the Austrian Science Fund (FWF) and the EU. Key achievements include contributions to spanning tree enumeration on Sierpinski graphs and resistance scaling in self-similar lattices. His publications span topics like asymptotic enumeration, determinant identities for Laplacian matrices, and structural properties of nilpotent groups. He received the Austrian Mathematical Society's Studienpreis (2003) for his thesis on self-similar graphs and fractals. Teaching responsibilities include advanced courses in combinatorics and probability, with a full teaching record documented in alma.

Siamak F. ShahandashtiView profile

Senior Lecturer

• Cyber Security
• Privacy
• Cryptography
• +3 more

Siamak F. Shahandashti is a Senior Lecturer (Associate Professor) in the Department of Computer Science at the University of York, UK. He leads the Cyber Security and Privacy Research Group and is involved in academic leadership roles such as Programme Lead for the MSc Cyber Security. His research focuses on cyber security, privacy, cryptography, and blockchain technology, with notable contributions to post-quantum cryptography, secure authentication frameworks, and privacy-preserving systems. Education: PhD in Computer Science, MSc and BSc in Electrical Engineering. His work integrates technical innovation with human-centered design, addressing challenges in user privacy, secure protocols, and resilient systems. Key research areas include: Cryptography and Post-Quantum Security Blockchain and Distributed Ledger Technology User-Centric Privacy Solutions Cyber Security Resilience in IoT and Edge Computing Current projects include PRIME (protecting minority ethnic communities online) and PHAWM (participatory harm auditing methodologies). He has been recognized for collaborative achievements, including a best paper award for work on DoS-resilient Bitcoin mempools and contributions to password manager governance frameworks. Teaching includes the MSc module 'Cryptography Theory and Practice', emphasizing both theoretical foundations and real-world applications.

Maris OzolsView profile

Assistant Professor

• Quantum Algorithms
• Quantum Information Theory
• Quantum Cryptography
• +3 more

Maris Ozols is an Assistant Professor at the University of Amsterdam and a researcher at QuSoft, affiliated with the Algorithms and Complexity department at Centrum Wiskunde & Informatica (CWI). His primary research focuses on quantum algorithms and quantum information theory, with significant contributions to quantum complexity, quantum cryptography, and quantum state discrimination. His research interests span quantum algorithms, quantum information theory, quantum cryptography, quantum complexity, and theoretical computer science. Ozols has developed fundamental techniques in quantum query complexity, quantum state discrimination, and quantum cryptographic security models. His work often bridges theoretical computer science with quantum information physics, demonstrating practical implications for quantum computing architectures. His publication record shows consistent output in top venues including Communications in Mathematical Physics, Leibniz International Proceedings in Informatics, and Quantum journal. Recent work (2022-2025) focuses on quantum state discrimination, quantum circuit optimization, quantum machine learning, and cryptographic applications of quantum algorithms. His research demonstrates strong theoretical foundations with practical implications for quantum computing development. Leverhulme Early Career Fellow (University of Cambridge) Ozols has secured research funding through multiple Netherlands Organisation for Scientific Research (NWO) grants including the Quantum Software Consortium (QSC) and Quantum Computation with Bounded Space projects. His collaborative work spans international institutions including the University of Waterloo (where he earned his PhD), University of Cambridge, IBM Research, and various European quantum computing groups. He maintains active research groups in quantum algorithms at both QuSoft and CWI, with recent focus on quantum machine learning applications and quantum cryptographic protocols.

• Wireless Communications
• Mathematics
• Artificial Intelligence
• +5 more

Keivan Navaie is a Professor of Intelligent Networks at Lancaster University’s School of Computing and Communications. He serves as a member of the Independent Scientific Advisory Committee at the Alan Turing Institute, overseeing the £100 million BridgeAI programme, and previously as Principal AI Technology Advisor to the UK Information Commissioner’s Office (ICO). He is recognized with Fellowships from the Institution of Engineering and Technology (IET), Chartered Engineer status in the UK, Senior Fellowship of the Higher Education Academy (HEA), and the IEEE Young Investigator Award. Research Focus: Wireless communications, mathematics, artificial intelligence, 6G networks, blockchain technology, edge computing, cognitive radio networks, and non-orthogonal multiple access (NOMA). Supervision: Actively supervises PhD students in areas like wireless communications and mathematical modeling. Projects: Involved in distributed learning, blockchain integration, 6G research, and spectrum sharing systems. Awards: IEEE Young Investigator Award, Fellow of IET, Chartered Engineer, Senior Fellow of HEA.

Laura S LembeckView profile

Lecturer

• Mathematics Education
• Curriculum Development
• Cryptography
• +3 more

Laura S Lembeck is an Associate Instructor at the College of Arts and Sciences within Western Carolina University , specializing in Mathematics and Computer Science. With over two decades of experience in mathematics education, she has held various instructional roles at institutions including Georgia Perimeter College and Florida Atlantic University, focusing on curriculum development and student success in developmental mathematics. Education: MS in Mathematics, Florida Atlantic University (2006) BS in Computer Science, Western Carolina University (1983) BSED in Mathematics, Western Carolina University (1982) Research interests include mathematics education, cryptography, and the integration of educational technology into curriculum design. Her work emphasizes flipped classroom strategies, online learning platforms, and course redesign to enhance student engagement. Scientific awards and recognitions include multiple teaching excellence nominations, induction into Florida Atlantic University’s Parliament of Owls, and honors for curriculum innovation. She has also contributed to national forums on transforming math education through presentations on course redesign and student advising. Her scholarly presentations highlight trends in developmental mathematics, cryptography, and the use of technology in education, reflecting a commitment to pedagogical innovation and historical applications of mathematics.