جست‌وجوی استاد و پژوهشگر

Maria Corte-Real Santosمشاهده پروفایل

پژوهشگر

• Post-Quantum Cryptography
• Isogeny-Based Cryptography
• Computational Number Theory
• +۳ مورد دیگر

Maria Corte-Real Santos is a post-doctoral researcher at École Normale Supérieure de Lyon (ENS de Lyon), affiliated with the Unité de Mathématiques pures et appliquées (UMPA). Her research focuses on post-quantum cryptography, particularly isogeny-based systems and computational number theory. Previously, she completed her PhD at University College London (UCL), specializing in cybersecurity and information security under the supervision of Philipp Jovanovic and Sarah Meiklejohn. She holds an undergraduate and master’s degree in Mathematics from the University of Cambridge, focusing on Algebraic Number Theory and Elliptic Curves. She organizes The Isogeny Club, a collaborative platform for researchers in isogeny-based cryptography. Her work includes contributions to SQIsign, a post-quantum signature scheme, and SuperSolver, an algorithm accelerating isogeny-based cryptographic computations. She has presented at numerous conferences, including the SQIparty workshop, Séminaire d’arithmétique à Lyon, and MIT’s Cryptography and Information Security Seminar, discussing topics like isogeny graphs, cryptographic smooth neighbors, and dimension-2 isogeny problems. Her research emphasizes practical applications of isogeny-based cryptography, including optimizing algorithms for efficiency and security. She actively engages in academic outreach through blog posts and talks, demystifying complex cryptographic concepts for broader audiences.

Renate Scheidlerمشاهده پروفایل

استاد

• Algorithmic Number Theory
• Mathematical Cryptography
• Algebraic Geometry
• +۳ مورد دیگر

Renate Scheidler is a Professor at the University of Calgary, holding dual appointments in the Department of Mathematics and Statistics and the Department of Computer Science. She obtained her Ph.D. from the University of Manitoba in 1993 and previously served as faculty at the University of Delaware until 2001. Her research focuses on computationally hard problems in mathematical structures like global fields and algebraic curves, driven by both theoretical insights and cryptographic applications. Dr. Scheidler is an editor for leading journals in her field and co-chairs the Steering Committee for the Algorithmic Number Theory Symposia (ANTS) series. She co-founded ISPIA’s predecessor, Calgary’s Centre for Information Security and Cryptography (CISaC), and serves on the steering committee of the Women in Numbers (WIN) research network, established in 2008. Her work bridges algorithmic number theory, cryptography, and computational algebra, with recent emphasis on isogeny-based cryptography and real quadratic field protocols. Her research trends reflect sustained contributions to cryptographic applications of algebraic curves, function fields, and infrastructure in number theory. Over the years, she has explored topics such as supersingular isogeny graphs, SCALLOP cryptosystem optimizations, and divisor class group arithmetic, highlighting her role in advancing post-quantum cryptography and computational methods. She actively promotes collaboration through initiatives like WIN and ANTS, fostering inclusivity and innovation in her field. In advising and grants, while no formal advisees are listed, her collaborative roles in institutes like ISPIA and CISaC suggest mentorship through institutional leadership. She contributes to interdisciplinary teams focused on security, privacy, and information assurance, leveraging her dual departmental expertise. Her involvement in labs and research networks underscores a commitment to both foundational research and applied cryptographic solutions.

• Post-Quantum Cryptography
• Zero-Knowledge Proofs
• Isogeny-Based Cryptography
• +۳ مورد دیگر

Professor Craig Costello is a leading cryptographer at the Queensland University of Technology (QUT) , affiliated with the Faculty of Science and the School of Computer Science . His work focuses on post-quantum cryptography , particularly isogeny-based and lattice-based cryptographic constructions , contributing to global efforts in securing digital infrastructure against quantum computing threats. Notable research trends include: Advancements in supersingular isogeny key exchange (SIKE/SIDH) Exploration of pairing-friendly abelian varieties for cryptographic cycles Efficient genus 2 isogeny algorithms and Kummer surface optimizations Development of twin smooth integer detection for cryptanalysis His publications emphasize quantum-resistant protocols , mathematical foundations , and practical cryptographic implementations . Contact: craig.costello@qut.edu.au

Emmanuela Orsiniمشاهده پروفایل

استادیار

• Cryptography
• Secure Computation
• Multiparty Computation
• +۷ مورد دیگر

Emmanuela Orsini serves as an Assistant Professor in the Department of Computing Sciences at Bocconi University in Milan, Italy. She previously held a permanent position as a Research Expert in the Computer Security and Industrial Cryptography (COSIC) group at KU Leuven, Belgium, and worked as a Senior Research Associate at the University of Bristol, UK. Her educational background includes a PhD in Mathematics and Statistics for the Computational Sciences from the University of Milano and a Master's degree in Mathematics from the University of Pisa. These qualifications form the foundation of her expertise in both theoretical and applied aspects of cryptography. Orsini's research spans the theoretical and practical dimensions of secure computation, with particular emphasis on multiparty computation and homomorphic encryption. Her work on efficient zero-knowledge schemes has contributed to practical implementations of cryptographic protocols that maintain security while optimizing computational resources. She has made significant contributions to post-quantum cryptography, notably through her involvement in the NIST post-quantum standardization process with the LIMA and NewHope submissions, as well as developing the FAEST signature algorithm which leverages AES for quantum-resistant signatures. Analysis of her recent publications reveals a strong focus on optimizing cryptographic protocols for practical deployment. Her work demonstrates consistent advancement in making multi-party computation more efficient while maintaining security guarantees, with particular attention to zero-knowledge proofs and post-quantum cryptographic constructions. The progression from theoretical foundations to practical implementations is evident across her publication history. Orsini has served on program committees for numerous prestigious cryptography conferences including CRYPTO, EUROCRYPT, and ACM CCS, reflecting her standing in the cryptographic research community. Her editorial work includes serving on the boards of Mathematical Cryptology and Communications in Cryptology. Her teaching activities span multiple institutions, with recent courses including Information Theory and Introduction to Computer Science at Bocconi University. Previously, she has taught post-quantum cryptography at the University of Pisa, public key cryptography at ESA/ESTEC, and coding theory at KU Leuven and University of Bristol. Orsini actively contributes to collaborative research projects, particularly in the post-quantum cryptography space through her involvement with the NIST standardization process. Her recent work on FAEST demonstrates her leadership in developing practical quantum-resistant signature schemes that balance security, efficiency, and implementation considerations.

Joseph P. Nearمشاهده پروفایل

دانشیار

• Data Privacy
• Differential Privacy
• Computer Security
• +۵ مورد دیگر

Joseph P. Near is an Associate Professor in the Department of Computer Science at the University of Vermont's College of Engineering and Mathematical Sciences. He maintains his office in E458 Innovation Hall and is actively engaged in teaching, research, and service activities. His work bridges theoretical computer science with practical privacy-preserving technologies. His educational background includes a B.S. in Computer Science from Indiana University and both M.S. and Ph.D. degrees in Computer Science from MIT. Ph.D., Massachusetts Institute of Technology M.S., Massachusetts Institute of Technology B.S., Indiana University Near's research focuses on practical applications of data privacy, particularly differential privacy, secure computation techniques, and programming language approaches to security. His work addresses real-world challenges in implementing privacy-preserving systems that maintain data utility while protecting individual information. He has developed frameworks for differential privacy implementation and has extensively studied the usability challenges faced by practitioners implementing privacy protections. His recent publications reveal a strong focus on making differential privacy more practical and accessible, with numerous contributions to choreographic programming for secure computation, language-based security approaches, and tools for evaluating privacy guarantees. The research trajectory shows increasing attention to usability issues alongside technical innovations, reflecting a maturing field where practical adoption challenges are becoming as important as theoretical advances. Near actively mentors multiple Ph.D. students through the UVM PLAID lab and the UVM Center for Computer Security and Privacy. His service contributions include organizing workshops like TPDP (Theory and Practice of Differential Privacy) and serving on program committees for major security conferences including CCS, USENIX Security, and PETS. His teaching portfolio includes specialized courses on Data Privacy and Secure Distributed Computation, reflecting his research expertise. He has co-authored significant educational resources including the book "Programming Differential Privacy" and is working on "Differential Privacy for Databases," demonstrating his commitment to making these complex topics accessible to practitioners.

M. Anwar Hasanمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Embedded Systems
• +۴ مورد دیگر

M. Anwar Hasan is a Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, where he has been a faculty member since January 1993. He was promoted to Associate Professor with tenure in 1998 and to full Professor in 2002. At Waterloo, he is also a member of the Centre for Applied Cryptographic Research, the Center for Wireless Communications, and the VLSI Research group. He previously spent 1992 as a post-doctoral fellow at the University of Victoria. Dr. Hasan received his B.Sc. and M.Sc. degrees in electrical and electronic engineering and computer engineering, respectively, from the Bangladesh University of Engineering and Technology in 1986 and 1988. He earned his Ph.D. in electrical engineering from the University of Victoria in 1992. His research focuses on cryptographic computations and embedded systems, dependable and secure computing, computer and network security, and computer arithmetic and architecture. His work has particularly emphasized efficient implementations of cryptographic algorithms, especially elliptic curve cryptography, with attention to side-channel attack resistance and fault tolerance. He has made significant contributions to finite field arithmetic, which forms the mathematical foundation for many cryptographic systems. Dr. Hasan's recent publications demonstrate continued leadership in cryptography, with work spanning traditional cryptographic implementations, post-quantum cryptography (particularly isogeny-based approaches), blockchain applications, secure multi-party computation, and hardware optimization for cryptographic operations. His research maintains a strong focus on both theoretical foundations and practical implementations. Raihan Memorial Gold Medal President's Research Scholarship (awarded four times at University of Victoria) Faculty of Engineering Distinguished Performance Award (2000) Outstanding Performance Award (2004) As a member of the Centre for Applied Cryptographic Research, Dr. Hasan has led numerous research projects in cryptographic hardware and software implementations. He served as an associate editor of the IEEE Transactions on Computers from 2000 to 2004 and has been involved in program and executive committees for several conferences. His research has been supported by various grants that have enabled him to supervise numerous graduate students and postdoctoral fellows, though specific grant details are not provided in the source material. Dr. Hasan's laboratory work has focused on implementing efficient and secure cryptographic systems, particularly examining side-channel attacks and developing countermeasures. His research team has produced numerous technical reports through the Centre for Applied Cryptographic Research (CACR) at Waterloo, demonstrating a sustained research program in cryptographic engineering.

Tony Shaskaمشاهده پروفایل

استاد مهمان

• Algebraic Geometry
• Number Theory
• Computational Algebra
• +۷ مورد دیگر

Tony Shaska is a Visiting Professor in the Department of Mathematics at the University of Michigan, specializing in Algebraic Geometry, Number Theory, and their applications to cryptography and machine learning. He holds a B.S. from the University of Michigan (1994), and M.S. and Ph.D. from the University of Florida (1998, 2001). His research spans several interconnected fields, with primary focus on superelliptic curves, Jacobians, weighted projective spaces, and isogeny-based cryptography. He has made significant contributions to computational algebra, particularly in computing loci of genus 2 curves with (n,n)-split Jacobians. More recently, he has pioneered the application of machine learning to algebraic geometry problems, developing novel frameworks like Graded Transformers and Graded Neural Networks that integrate symbolic mathematics with geometric learning approaches. His publication record shows remarkable productivity with numerous papers in 2024-2025 covering cutting-edge intersections of pure mathematics with AI and cryptography. His work demonstrates an evolving trajectory from classical algebraic geometry toward innovative applications in post-quantum cryptography and geometric deep learning. Shaska has been active in organizing academic events including NATO workshops on cryptography and has filed recent patents related to graded transformer architectures and graded codes for blockchain security.

Katherine Stangeمشاهده پروفایل

استاد

• Number Theory
• Elliptic Curves
• Cryptography
• +۳ مورد دیگر

Katherine Stange is a Professor of Mathematics at the University of Colorado Boulder. Her research bridges number theory, cryptography, and geometry, with particular focus on elliptic curves, isogeny-based cryptography, and complex dynamical systems. Research explores: Arithmetic dynamics of Apollonian circle packings Isogeny-based post-quantum cryptographic protocols Algebraic structures in computational complexity Mathematical visualization and illustration techniques Recent publications demonstrate increasing focus on computational aspects of algebraic structures, with multiple papers on tensor/group isomorphism problems. Teaching innovations include standards-based grading systems and visual mathematics pedagogy. Awards include the NSF Postdoctoral Fellowship and Dean's Faculty Fellowship. Organizing 2026 trimester program at Institut Henri Poincaré in Paris.

• Cryptography
• Mathematics
• Computer Science
• +۳ مورد دیگر

Mattia Veroni is a Research Fellow at the Department of Mathematical Sciences, Norwegian University of Science and Technology (NTNU). His primary research focuses on isogeny-based cryptography, elliptic curve theory, and post-quantum security protocols. He is actively involved in advancing cryptographic systems resilient to quantum computing threats, particularly through the analysis and optimization of SIDH (Supersingular Isogeny Diffie-Hellman) based schemes. His research interests span both theoretical and applied aspects of cryptography. Theoretical work involves studying supersingular elliptic curves, endomorphism rings, and isogeny graphs, while applied contributions address practical implementations of isogeny-based key exchange and signature mechanisms. He emphasizes efficiency and security in cryptographic algorithms, aiming to bridge foundational mathematics with real-world cryptographic applications. Recent articles highlight trends in improving SIDH-based signature efficiency, analyzing collisions in isogeny graphs, and optimizing the tightness of cryptographic protocols. These contributions reflect a deep engagement with post-quantum cryptography standards and algorithmic rigor. Although no scientific awards or grants are explicitly mentioned, his work demonstrates significant advancements in the field of isogeny-based cryptography. He has collaborated with researchers such as Jonathan Komada Eriksen, Lorenz Panny, Wissam Ghantous, and Kristian Gjøsteen on key projects. No advising roles or student supervision details are provided in the available texts.

• Cryptography
• Mathematical Cryptology
• Elliptic Curve Cryptography
• +۳ مورد دیگر

Mattia Veroni is a Research Fellow at the Department of Mathematical Sciences, Norwegian University of Science and Technology (NTNU). His research focuses on cryptography, particularly isogeny-based cryptographic protocols, elliptic curve cryptography, and algorithmic number theory. He has contributed to advancements in post-quantum cryptography, including studies on supersingular elliptic curves and SIDH-based signature schemes. His work emphasizes practical implementations of cryptographic systems, such as optimizing isogeny-based key exchanges for real-world applications. Publications include contributions to Contemporary Mathematics , Journal of Mathematical Cryptology , and Lecture Notes in Computer Science (LNCS) .

• Algorithmic Arithmetic Geometry
• Number Theory
• Asymmetric Cryptography
• +۴ مورد دیگر

Benjamin Smith is a computational number theorist and algebraic curve specialist affiliated with INRIA and École polytechnique's Computer Science Department. He contributes to post-quantum cryptography through projects like Wave (code-based signatures), CTIDH (isogeny-based key exchange), and Velusqrt (faster isogeny algorithms). He also developed microcontroller cryptographic libraries μKummer and qDSA . His research focuses on: Algorithmic arithmetic geometry Number theory in cryptography Efficient implementations of pre- and post-quantum cryptosystems Explicit isogeny constructions for higher-genus curves He leads Inria's participation in the HYPERFORM consortium and co-founded the diamond-access journal Communications in Cryptography . His work bridges theoretical mathematics and practical cryptographic engineering, with a particular emphasis on real-world implementation challenges.

Luciano Mainoمشاهده پروفایل

مدرس

• Cryptography
• Computer Science
• Information Security
• +۱ مورد دیگر

Luciano Maino is a Lecturer in Cryptography at the School of Computer Science, University of Bristol. His research focuses on isogeny-based cryptography, public-key encryption, and cryptographic hash functions. University: University of Bristol School: School of Computer Science Academic Rank: Lecturer His work explores advanced cryptographic protocols using mathematical structures like isogenies and elliptic curves, aiming to enhance security and efficiency in encryption methods. Recent publications highlight his contributions to compact identification schemes and higher-dimensional isogeny applications. Scientific Awards: Best Paper Honorable Mention (2023)

Marzio Mulaمشاهده پروفایل

پژوهشگر ارشد

• Cryptography
• Elliptic Curve Cryptography
• Isogeny-based Cryptography
• +۳ مورد دیگر

Marzio Mula serves as a Research Fellow at the Institute for Theoretical Informatics, Mathematics and Operations Research, Bundeswehr University Munich, affiliated with the QuSAC Lab since February 2024. His academic background includes: Master's in Mathematics from the University of Turin (2020), focusing on sampling supersingular elliptic curves for cryptographic applications PhD from the University of Trento (2024) with research internships at IBM Research Zurich and COSIC at KU Leuven Dr. Mula specializes in isogeny-based cryptography , investigating pairings and Hessian graphs of elliptic curves, while extending into abstract number-theoretical domains like p-adic continued fractions . His work bridges theoretical mathematics with post-quantum cryptographic system development, emphasizing mathematical structures for quantum-resistant security. He actively contributes to the QuSAC Lab's mission in quantum-safe cryptographic research. Contact: marzio.mula@unibw.de

Jake Doliskaniمشاهده پروفایل

استادیار

• Post-quantum Cryptography
• Quantum Computing
• Cryptography
• +۳ مورد دیگر

Dr. Jake Doliskani is an Assistant Professor in the Department of Computing and Software at McMaster University, Faculty of Engineering. His research focuses on Post-Quantum Cryptography, Quantum Computing, and Applied Cryptography. He previously held faculty positions at TMU and was an NSERC postdoctoral fellow at the Institute for Quantum Computing (University of Waterloo). He earned his PhD in Computer Science from Western University under Éric Schost, with a focus on computational algebra and cryptography. Education: PhD in Computer Science, Western University (2016) MSc/BS in Computer Science (Details not explicitly stated) His research explores quantum-resistant cryptographic systems, quantum algorithms, and cryptographic protocol design. Notable contributions include advancements in isogeny-based cryptography, quantum money schemes, and efficient quantum algorithms for polynomial factorization. His work bridges theoretical foundations with practical applications in security and computational efficiency. Publications span topics like cryptographic hash functions, quantum software verification, and algebraic methods in cryptography. His work has been recognized with awards, including the Distinguished Paper Award at ICSE 2020 for contributions to quantum software testing. Advising & Opportunities: Open to supervising MSc/PhD students in Quantum Computing, Post-Quantum Cryptography, and Cryptography. He teaches advanced courses such as Quantum Computing and Quantum Cryptography (Theory) , emphasizing quantum mechanics fundamentals and cryptographic applications. Affiliations & Lab Involvement: Active in research groups focused on post-quantum security and quantum algorithm design. Office: ITB 125, McMaster University.

• Cryptography
• Post-Quantum Cryptography
• Cryptographic Engineering
• +۴ مورد دیگر

Peter Schwabe is a scientific director at the Max Planck Institute for Security and Privacy (MPI-SP) in Bochum, Germany, and a part-time professor for cryptographic engineering in the Digital Security Group at Radboud University in Nijmegen, The Netherlands. He has held these positions while leading significant research initiatives in post-quantum cryptography and high-assurance cryptographic implementations. His research interests center on post-quantum cryptography, cryptographic engineering, and high-assurance crypto software. Schwabe's work focuses on developing and verifying cryptographic implementations that are resistant to side-channel attacks while maintaining high performance. He has made significant contributions to lattice-based cryptography, hash-based signatures, and the standardization of post-quantum cryptographic algorithms. His research bridges theoretical cryptography with practical implementation concerns, particularly for resource-constrained environments. Analysis of Schwabe's recent publications reveals a strong focus on post-quantum cryptography standardization, formal verification of cryptographic implementations, and protection against side-channel attacks. His work spans theoretical advances in cryptographic primitives, practical implementations for real-world systems, and tools for verifying the security properties of cryptographic code. A significant portion of his recent work relates to the CRYSTALS-Kyber standard selected by NIST, including formal verification of its security properties and implementation correctness. Schwabe has served as an elected member of the IACR Board of Directors, member of the IACR CHES Steering Committee, and member of the IACR RWC Steering Committee. He is also a member of the advisory boards of Bitmark Inc., PQShield, Neutrality, and SciEngines, demonstrating his influence in both academic and industry cryptographic communities. As an advisor, Schwabe has supervised numerous Ph.D. students working on various aspects of cryptography, including post-quantum cryptography, side-channel resistance, and formal verification of cryptographic implementations. His work on the EPOQUE project (Engineering post-quantum cryptography), funded by an ERC Starting grant from October 2018 to December 2023, demonstrates his leadership in advancing post-quantum cryptographic research. Schwabe leads research efforts at the intersection of formal methods and practical cryptography, with a particular emphasis on creating high-assurance cryptographic implementations that can withstand both theoretical and practical attacks. His work often involves collaboration with international teams across academia and industry to advance the state of the art in cryptographic engineering.