SaTC 2.0: RES: Classical and quantum algorithms for problems in cryptography — NSF Award to Pennsylvania State Univ University Par
This project focuses on the security and efficiency of certain cryptosystems. Since currently used systems are vulnerable to attacks by quantum computers, it is essential to develop and analyze alternatives that are resistant to quantum computers, so that they remain secure in a post-quantum world. This project investi
| Award title | SaTC 2.0: RES: Classical and quantum algorithms for problems in cryptography |
|---|---|
| Award ID | 2521084 |
| Awardee | Pennsylvania State Univ University Park |
| City | UNIVERSITY PARK |
| State | PA |
| Amount obligated | $600,000 |
| Principal investigator | Kirsten Eisentraeger |
| Program | Secure &Trustworthy Cyberspace |
| Start date | 05/15/2026 |
| Abstract | This project focuses on the security and efficiency of certain cryptosystems. Since currently used systems are vulnerable to attacks by quantum computers, it is essential to develop and analyze alternatives that are resistant to quantum computers, so that they remain secure in a post-quantum world. This project investigates both the classical and post-quantum security of cryptosystems based on supersingular isogenies, as well as lattice-based schemes proposed as replacements for currently used s |
| Source | NSF Awards |
$799/mo
Try NSFGrants →