جستجوی استاد راهنمای دانشگاهی

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Professor Dinesh S. Thakur holds the position of Professor in the Department of Mathematics at the University of Rochester. He earned his PhD from Harvard University and has made significant contributions to number theory, arithmetic geometry, and function field arithmetic. His research focuses on developing theories related to zeta functions, Drinfeld modules, and p-adic analysis in finite characteristic environments. Education: PhD in Mathematics, Harvard University Research Interests: Thakur’s work integrates advanced topics such as elliptic curves, modular forms, Diophantine equations, and the arithmetic of function fields. He has pioneered studies on multizeta values, p-adic continued fractions, and the distribution of Diophantine exponents in finite characteristic. His research bridges classical number theory with modern algebraic geometry and p-adic analysis. Teaching & Mentorship: Thakur has taught a wide range of courses, including graduate-level topics in function field arithmetic, algebraic geometry, and number theory. He has advised 11 PhD students and several master’s students, whose theses span themes like elliptic Carmichael numbers, Drinfeld modular forms, and multizeta relations. Notable advisees include Javier Diaz-Vargas (1996), George Todd (2015), and Yao-Rui Yeo (2021). Outreach & Contributions: Thakur participates in initiatives like the Arizona Winter School and Olympiad training programs in India. He maintains an active seminar series at UR on topics such as L-values, Fermat’s Last Theorem, and automatic sequences. His work is accessible through his personal page and MathSciNet.

• Number Theory
• Arithmetic Geometry
• Function Field Arithmetic
• +۷ مورد دیگر

Alessandro Chiesa is an Associate Professor at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences, holding positions across multiple departments including Computer Security (COMPSEC), SSC, SIN, and EDIC. His office is located at BC 245 in Building BC, Station 14, Lausanne, Switzerland. Chiesa's research spans cryptography, complexity theory, and computer security, with particular focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. His work bridges theoretical computer science with real-world applications, especially in blockchain technology and privacy-preserving systems. He has made significant contributions to zero-knowledge proof systems, including zkSNARKs, and their applications in cryptocurrency. His publications reveal a strong focus on cryptographic protocols, with particular emphasis on privacy-preserving technologies. The analysis of his articles shows consistent work in applying mathematical foundations to practical security problems, especially in the domain of blockchain and digital currencies. His research demonstrates expertise in both theoretical aspects of cryptography and their implementation in real systems. IEEE SP Test-of-Time Award (2024) Sloan Research Fellowship (2021) Okawa Foundation Research Grant (2020) Google Faculty Research Awards (2018 and 2017) MIT Technology Review's 35 Innovators Under 35 list (2018) Chiesa has supervised multiple PhD students including Di Zijing, Fenzi Giacomo, Guan Ziyi, Knabenhans Christian Louis, Manzur Ignacio, Weissenberg Guy, and Zheng Yuxi. His teaching includes Algorithms I, Foundations of Probabilistic Proofs, and Lattice-based Cryptography. He co-founded Zcash and StarkWare Industries, translating his theoretical research into practical applications that have significantly impacted the cryptocurrency space.

• Cryptography
• Complexity Theory
• Computer Security
• +۳ مورد دیگر

Rida Khatoun is a Professor in Cybersecurity at the Computer Sciences and Networks (Infres) Department at Télécom Paris. He holds a M.Sc. in Computer Engineering and a Ph.D. from the University of Technology of Troyes (UTT), France, awarded in 2004 and 2008, respectively. His research focuses on cybersecurity in networks, including cloud computing security, IoT security, vehicular networks security, intrusion detection systems, and blockchain technology. He has taught at Telecom Paris since 2014, Shanghai Jiao Tong University (SJTU) since 2016, and other institutions in China and France since 2005. His work spans theoretical frameworks and practical solutions for network security challenges. Key research areas include DDoS attack detection, vehicular communication security, and cryptographic protocols. He leads the Cybersecurity and Cryptography (C²) research team and is affiliated with the Laboratoire Traitement et Communication de l'Information (LTCI). His contributions include developing secure routing protocols (e.g., ASROP), statistical trust systems in wireless networks, and blockchain-based authentication for IoT. He has authored over 115 publications, including peer-reviewed articles and conference proceedings, with recent work addressing vehicular platooning security, TLS handshake optimization for C-ITS, and machine learning for cyberbullying detection. Rida’s academic activities include teaching courses on network security protocols, wireless network fundamentals, and QoS mechanisms. He collaborates internationally, contributing to smart city cybersecurity architectures and 6G programmable communications. His research emphasizes practical cybersecurity solutions for emerging technologies, ensuring robust protection against evolving threats in vehicular, IoT, and cloud environments.

• Cybersecurity
• Network Security
• Cloud Computing Security
• +۶ مورد دیگر

Jaclyn Lang is the Selma Lee Bloch Brown Assistant Professor of Mathematics at Temple University. Her research centers on algebraic number theory, focusing on modular forms, Galois representations, elliptic curves, motives, and p-adic methods. Education: Ph.D. in Mathematics, UCLA (2016), advised by Haruzo Hida Part III of the Mathematical Tripos, University of Cambridge (2010), supervised by Tom Fisher MA in Mathematics, Bryn Mawr College (2009), supervised by Helen Grundman Research Interests: She works on advanced problems in number theory, including the Eisenstein ideal, pseudorepresentations, and arithmetic geometry of elliptic curves. Her work often bridges algebraic geometry and automorphic forms using p-adic techniques. Scientific Awards: Churchill Scholarship (2009–2010) Clare Booth Luce Scholarship (2007–2009) NSF Graduate Research Fellowship (2010–2015) Charles E. and Sue K. Young Graduate Student Award (2015) NSF Mathematical Sciences Postdoctoral Research Fellowship (2016–2020) AWM Travel Grant (2023) Fulbright U.S. Student Program Grant (2016) Simons Travel Support for Mathematicians (2023–2028) Grants: She has received NSF Standard Grant DMS-331117 (2023–2026) and participated in programs like the Park City Math Institute and Women in Numbers Europe (WINE3).

• Algebraic Number Theory
• Modular Forms
• Galois Representations
• +۳ مورد دیگر

David Jao is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on post-quantum cryptography, particularly leveraging isogenies of supersingular elliptic curves for secure cryptographic protocols. He is renowned for co-developing the Supersingular Isogeny Key Encapsulation (SIKE) protocol, a leading candidate for post-quantum cryptography standards. His work spans theoretical foundations and practical implementations, including optimizing isogeny-based systems for embedded devices and ARM processors. Research interests include isogeny-based cryptosystems, elliptic curve cryptography, zero-knowledge proofs, and cryptographic security against quantum attacks. He explores applications of expander graphs and Ramanujan graphs in cryptography, alongside algorithmic improvements for cryptographic protocols such as SIDH (Supersingular Isogeny Diffie-Hellman). Key contributions include advancements in key compression techniques for SIKE, side-channel attack mitigation, and formalizing security models for post-quantum key exchange. His publications analyze cryptographic hardness assumptions, such as the discrete logarithm problem in finite groups and the semidirect product structure in isogeny-based systems. Jao’s work bridges theoretical mathematics and applied cryptography, with a focus on ensuring practical security in next-generation cryptographic systems. His research addresses challenges in quantum-resistant authentication, key establishment, and digital signatures, often emphasizing efficiency and resistance to both classical and quantum attacks.

• Cryptography
• Post-Quantum Cryptography
• Elliptic Curve Cryptography
• +۳ مورد دیگر

Tanja Lange is a Full Professor at the Department of Mathematics and Computer Science at Technische Universiteit Eindhoven. She chairs the Coding Theory and Cryptology group and serves as scientific director of the Eindhoven Institute for the Protection of Systems and Information (Ei/Ψ). Additionally, she holds a visiting professor position at Academia Sinica, Taiwan. Research & Teaching Her research focuses on cryptography and number theory , with leadership in post-quantum cryptography (including code-based, lattice-based, hash-based, and isogeny-based systems). She has taught courses like Introduction to Cryptology and Selected Areas in Cryptology at TU/e, covering quantum algorithms, cryptographic protocols, and mathematical foundations. Key Contributions Co-author of 5 recent publications (2023-2025) on differential addition chains, ROLLO-I analysis, CSIDH fault injection, and KpqC evaluations Recipient of the Best Master Lecturer 2016 award Active in NIST Post-Quantum Cryptography competition (e.g., NTRU Prime) Affiliated with the Center for Quantum Materials and Technology Eindhoven Contact MetaForum 5.062, TU/e Email: tanja@hyperelliptic.org (primary) | t.lange@tue.nl (TU/e)

• Cryptography
• Number Theory
• Post-Quantum Cryptography
• +۵ مورد دیگر

Lawrence C. Washington is a Professor of Mathematics at the University of Maryland, College Park . His office is located in Mathematics Building 1105, and he can be reached at lcw@math.umd.edu . Teaching & Courses: In Spring 2023 he is teaching Cryptography 456 (TuTh 11:00–12:15) and co-organising the Algebra Seminar (MW 2–3). Office hours are held Tuesdays 1:30–2:30 and Thursdays 10:00–10:50. Research Interests: His work centres on number theory , with particular emphasis on cyclotomic fields , elliptic curves , cryptology , and Iwasawa theory . He has made extensive contributions to the study of p-adic L-functions , class groups , heuristics for class numbers , and the arithmetic of elliptic curves, often bridging deep theoretical questions with computational investigations. Textbooks & Scholarly Output: Washington is the author of several widely-used textbooks: Introduction to Cryptography with Coding Theory (3rd ed.) Introduction to Cyclotomic Fields Elliptic Curves: Number Theory and Cryptography An Introduction to Number Theory with Cryptography (2nd ed.) Elementary Number Theory Recent Publication Trends: Over the past five years his papers have focused on heuristics for Iwasawa invariants , anti-cyclotomic extensions , class groups of real cyclotomic fields , and analytic estimates for sums of prime powers . The work is characterised by a synthesis of algebraic, analytic, and computational techniques, frequently yielding explicit examples and numerical data that inform broader conjectures in algebraic number theory. Extracurricular Interests: Outside mathematics, Washington enjoys running and playing the bassoon , and he maintains a light-hearted page devoted to his favourite intersection in Chevy Chase, MD. Advising & Grants: While the provided text does not enumerate individual students or specific grants, his extensive publication record and long-standing professorship indicate ongoing supervision of graduate research and participation in funded projects in number theory and cryptography.

• Number theory
• Cyclotomic fields
• Elliptic curves
• +۵ مورد دیگر

Francesco Sica is an Assistant Professor in the Department of Mathematics and Statistics at Florida Atlantic University, with research focused on mathematical cryptology, public-key cryptography, and number theory. He earned his Ph.D. in Mathematics from McGill University (1998), M.Sc. from Scuola Normale Superiore (1993), and B.Sc. from the University of Pisa (1993). Education Ph.D. in Mathematics, McGill University, Canada (1998) M.Sc. in Mathematics, Scuola Normale Superiore, Italy (1993) B.Sc. in Mathematics, University of Pisa, Italy (1993) His research spans implementation and security analysis of elliptic curve cryptography , including isogeny-based problems and torsion point attacks. He has also contributed to pseudorandom number generation, multistorage solutions on elliptic curves, and cryptographic competitions. Recent publications highlight advancements in isogeny-based security (2024), cryptographic Olympiad frameworks (2022), and integer factorization techniques using number-theoretic hints (2021). Earlier work (2019) addressed secure bit extraction from Koblitz curves. Sica previously collaborated with the NESSIE project at Université catholique de Louvain and worked at a crypto lab at the National University of Singapore. His work bridges theoretical number theory with practical cryptographic applications.

• Public-key cryptography
• Mathematical cryptology
• Number Theory
• +۲ مورد دیگر

Nathan Kaplan is a Professor in the Department of Mathematics at the University of California, Irvine, where he conducts research in number theory, algebraic geometry, and combinatorics. His work spans rational points on varieties over finite fields, arithmetic statistics, coding theory, and the study of numerical semigroups. He is actively involved in the mathematical community, organizing seminars and conferences including the UC Irvine Number Theory Seminar and the Southern California Number Theory Day. Dr. Kaplan received his PhD from Harvard University in 2013 under the direction of Noam Elkies. Following his doctorate, he was a postdoctoral researcher at Yale University from 2013-2015 before joining the faculty at UC Irvine. His research interests focus on the intersection of number theory and algebraic geometry, with particular attention to problems involving rational points on varieties over finite fields, arithmetic statistics, and coding theory. He has made significant contributions to the study of numerical semigroups, cokernels of random p-adic and integer matrices, and quadratic forms and lattices. His work often bridges theoretical mathematics with applications in coding theory and cryptography. Analysis of his recent publications shows a strong trend toward combinatorial aspects of number theory, particularly in the study of numerical semigroups and their properties. He frequently collaborates with researchers across institutions, with recent work spanning algebraic geometry, combinatorics, and coding theory. His publications demonstrate expertise in both theoretical developments and computational aspects of number theory. Dr. Kaplan is deeply committed to undergraduate research and mentoring. He has experience as a mentor for undergraduate research projects through programs including SUMRY (a research program for Yale undergraduates), the University of Minnesota-Duluth REU program, and the Trinity University REU program. He actively encourages undergraduates to apply for summer research opportunities and has organized numerous outreach activities. He is an organizer of the UC Irvine Number Theory Seminar and the Southern California Number Theory Day conference series. In 2018, he co-organized the Conference on Open Questions in Cryptography and Number Theory in honor of Alice Silverberg's 60th Birthday. Dr. Kaplan has given numerous talks at mathematical venues including the Museum of Mathematics' Math Encounters series, where he presented "Error-Correcting Codes: The Mathematics of Communication" in July 2022. He has also spoken at the Yale Undergraduate Math Society, the UCI Math Circle, and various other outreach events.

• Number Theory
• Algebraic Geometry
• Combinatorics
• +۶ مورد دیگر

Rizwanur Khan is an Assistant Professor in the Department of Mathematical Sciences at the University of Texas at Dallas (UT Dallas), affiliated with the School of Natural Sciences and Mathematics. His research focuses on analytic number theory, automorphic forms, and L-functions, with notable contributions to the study of moments of L-functions and elliptic curves. Education: Ph.D. in Mathematics, University of Michigan, Ann Arbor (2007) B.A. in Mathematics, University of Cambridge (2002) Research Interests: Khan’s work bridges analytic number theory and automorphic forms, emphasizing L-functions’ properties, such as moments, subconvexity bounds, and their applications to elliptic curves and modular forms. His research explores reciprocity relations, truncation techniques, and spectral analysis in these contexts. Publications Trends: Recent publications address moment estimates of L-functions, elliptic curve ranks over cyclotomic fields, and hybrid subconvexity bounds. His work often involves collaboration with experts in automorphic forms and spectral theory, reflecting a focus on advancing computational and theoretical tools in number theory. Awards: NSF CAREER Grant (2022–2027) NSF Standard Grant (2020–2024) Simons Collaboration Grant for Mathematicians (2019–2023) NSF CBMS Conference Grant (2018–2020) NSF Postdoctoral Fellowship (2007–2010) Grants and Advising: Khan has secured significant NSF and Simons Foundation funding to support research on L-functions and subconvexity. While no students are explicitly listed, his postdoctoral and faculty roles suggest mentorship in mathematical research. He has held positions at UCLA, University of Göttingen, Texas A&M at Qatar, and the University of Mississippi before joining UT Dallas in 2023. Labs/Teams: No specific labs or teams are mentioned, though his work likely intersects with number theory groups at UT Dallas and collaborating institutions.

• Analytic Number Theory
• Automorphic Forms
• L-functions
• +۳ مورد دیگر

Professor Tim Dokchitser is the Heilbronn Chair in Algebraic/Arithmetic Geometry at the School of Mathematics, University of Bristol. His research focuses on algebraic number theory, elliptic curves, arithmetic of L-functions, Galois theory, and computational algebra. He actively explores connections between number theory and finite groups, using computer experiments to advance conjectures like the Birch-Swinnerton-Dyer Conjecture. BSc, Lund University MSc, Lund University PhD, University of Utrecht MA, University of Cambridge His research spans hyperelliptic curves over local fields, Weil representations, tame Galois torsion, and finite group character formulas. Recent work includes computational approaches to Frobenius traces and étale cohomology in hyperelliptic curve quotients. Articles (2023-2025) highlight advancements in arithmetic geometry, zero-knowledge cryptography, and Galois representation theory. Scientific awards include a University Research Fellowship (2011-2014) for elliptic curves and L-functions. He leads projects like the 2015-2018 study on hyperelliptic curves and contributes to collaborations across arithmetic geometry. His computational methods have inspired conjectures in motivic cohomology and modular deformations.

• Algebraic Number Theory
• Elliptic Curves
• Arithmetic Geometry
• +۸ مورد دیگر

Assoc Prof Wu Hongjun is an Associate Professor at the Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University (NTU). His research focuses on cryptography and information security, with notable contributions to lightweight authenticated encryption algorithms like TinyJAMBU and ACORN, as well as cryptanalysis of stream ciphers (e.g., ZUC, HC-128) and hash functions (e.g., JH, SHA-3 candidates). His academic career includes over 15 years of contributions to cryptographic standards, IoT security frameworks, and secure cloud data management. Key areas of expertise encompass symmetric-key cryptography, algorithm design for resource-constrained devices, and vulnerability analysis of cryptographic primitives. Prof Wu has authored influential papers on authenticated encryption modes (AEGIS, MORUS), lightweight cipher optimizations (ACORN), and cryptanalysis techniques applied to Feistel networks and stream ciphers. His work bridges theoretical cryptography with practical implementations across telecommunications, IoT, and cloud computing domains.

• Cryptography
• Information Security
• Authenticated Encryption
• +۳ مورد دیگر

John Voight is a Professor of Mathematics at the University of Sydney, affiliated with the School of Mathematics and Statistics. He holds a Ph.D. from UC Berkeley (2005) and has held academic positions at the University of Sydney, University of Minnesota, University of Vermont, and Dartmouth College. His research focuses on arithmetic algebraic geometry, number theory, and computational aspects of these fields, including modular forms, elliptic curves, and quaternion algebras. Education: Ph.D. in Mathematics, UC Berkeley (2005); earlier studies include a focus on classical piano and liberal arts at Gonzaga University. Professional trajectory includes postdoctoral roles at the University of Sydney and University of Minnesota, followed by faculty appointments at the University of Vermont (2006–2013) and Dartmouth College (2013–present). Research Interests: Arithmetic algebraic geometry: modular curves, Shimura varieties, moduli spaces, and algorithmic methods Number theory: algebraic number theory, quadratic forms, cryptography, and coding theory Computational mathematics: modular forms, quaternion algebras, and database construction (e.g., LMFDB) Publications and Recognition: Over 90 peer-reviewed articles, including contributions to Contemp. Math. , Math. Comp. , and Res. Number Theory . Recipient of the Selfridge Prize in Number Theory and recognized for teaching excellence at Dartmouth. Leads projects on Hilbert modular forms and paramodular abelian surfaces. Teaching and Mentorship: Emphasizes student-centered learning and the integration of liberal arts with STEM. Advises students on topics ranging from elliptic curves to cryptography. Active in curriculum design and promoting computational tools in mathematics education. Labs/Teams: Collaborates with the L-Functions and Modular Forms Database (LMFDB) project, contributing to computational frameworks for algebraic geometry and number theory.

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

Riad S. Wahby is an Assistant Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University's College of Engineering. His work focuses on designing secure hardware and software systems, with recent emphasis on cryptographic proof systems. He actively mentors PhD students and collaborates across disciplines in cybersecurity, blockchain, and formal verification. PhD in Computer Science, Stanford University MEng in Electrical Engineering, Massachusetts Institute of Technology SB in Electrical Engineering, Massachusetts Institute of Technology Wahby's research spans cryptography , blockchain security , zero-knowledge proofs , and secure hardware-software co-design . His work addresses challenges in verifiable computation, privacy-preserving protocols, and hardware subversion resistance. Recent publications reveal trends in zero-knowledge proof systems (SNARKs, MPC), blockchain security (anonymous blocklisting, decentralized auctions), and hardware-crypto integration (weird machines, verifiable ASICs). Technical focus areas include formal verification, side-channel analysis, and cryptographic compilers. Distinguished Student Paper Award, IEEE Symposium on Security and Privacy (Oakland16), 2016 Best Paper Award, USENIX Annual Technical Conference (ATC18), 2018 Wahby collaborates with researchers across institutions and industries, including Dan Boneh at Stanford, Mike Walfish at NYU, and Silicon Labs in industrial roles. His CyLab affiliations connect him to over $400K in seed funding opportunities and blockchain initiatives at CMU.

• Cryptography
• Blockchain Security
• Secure Hardware Systems
• +۱۱ مورد دیگر