Jason LeGrow
Virginia Polytechnic Institute and State University, VA·Computer Science
Much of today's online security, from banking to messaging, relies on math problems that ordinary computers cannot solve quickly. Examples include factoring large numbers and the discrete logarithm problem.
- Fields
Computer Science
Mathematics & Statistics
- Topics
post-quantum cryptography
quantum-resistant cryptography
lattice-based cryptography
- Grants
- 1 known grant, through Apr 2029
What they work on
- Construct post-quantum blind signatures, threshold signatures and multisignatures based on lattices, error-correcting codes and group actions such as isogenies, maps between elliptic curves.
- Design post-quantum verifiable random functions, which produce random-looking outputs anyone can check, using zero-knowledge proofs and group action frameworks.
- Prove the security of the new protocols from well-defined computational hardness assumptions, and improve their efficiency and scalability.
More about the research
A large quantum computer running Shor's algorithm could solve these problems efficiently and break today's public-key cryptography. Post-quantum cryptography replaces these systems with schemes built on problems believed to stay hard even for quantum attackers. Standards so far cover mostly basic tools: encryption and digital signatures, which prove who sent a message. Many newer applications need richer features, including decentralized systems and privacy-preserving protocols.
Why it matters
Future large quantum computers could break the public-key cryptography that protects digital infrastructure. This work could give developers of decentralized systems and privacy-preserving services quantum-resistant tools. Examples include blind, threshold and multi-party signatures, and verifiable randomness, each backed by security proofs. That could help systems stay secure as communication moves into the post-quantum era.
Known grants
From NIH and NSF research grants. Labs often have other funding we can't see.
Closest labs
Frauke Bleher
University of Iowa, IA·Mathematics & Statistics
Improve explicit constructions of infinite families of number fields with small root discriminants, using Galois cohomology, explicit Chebotarev theorems and p-adic and modular-form methods related to Hilbert's 12th problem.
Jean-Francois Biasse
University of South Florida, FL·Mathematics & Statistics
Investigate hard algebraic and number-theoretic problems, including finding short vectors in Euclidean lattices, isogenies between curves, and inverting group actions, as foundations for next-generation cryptosystems.
Omkant Pandey
Stony Brook University, NY·Computer Science·Early-career
Construct secure multi-party computation protocols that remain secure when many sessions run concurrently and the adversary is a quantum computer, closing open questions in post-quantum secure computation.
The school
Virginia Polytechnic Institute and State University: 35 labs on PI Pages, $657M a year on research, 496 research doctorates a year.
More about Virginia Polytechnic Institute and State University
Reach out
A start for your email. Fill in the brackets.