| NSF Org: |
CNS Division Of Computer and Network Systems |
| Recipient: |
|
| Initial Amendment Date: | March 5, 2024 |
| Latest Amendment Date: | March 5, 2024 |
| Award Number: | 2340564 |
| Award Instrument: | Continuing Grant |
| Program Manager: |
Andrew Pollington
adpollin@nsf.gov (703)292-4878 CNS Division Of Computer and Network Systems CSE Directorate for Computer and Information Science and Engineering |
| Start Date: | July 1, 2024 |
| End Date: | June 30, 2029 (Estimated) |
| Total Intended Award Amount: | $458,572.00 |
| Total Awarded Amount to Date: | $179,714.00 |
| Funds Obligated to Date: |
|
| History of Investigator: |
|
| Recipient Sponsored Research Office: |
300 TURNER ST NW BLACKSBURG VA US 24060-3359 (540)231-5281 |
| Sponsor Congressional District: |
|
| Primary Place of Performance: |
300 TURNER ST NW BLACKSBURG VA US 24060-3359 |
| Primary Place of
Performance Congressional District: |
|
| Unique Entity Identifier (UEI): |
|
| Parent UEI: |
|
| NSF Program(s): | Secure &Trustworthy Cyberspace |
| Primary Program Source: |
01002627DB NSF RESEARCH & RELATED ACTIVIT 01002728DB NSF RESEARCH & RELATED ACTIVIT 01002425DB NSF RESEARCH & RELATED ACTIVIT |
| Program Reference Code(s): |
|
| Program Element Code(s): |
|
| Award Agency Code: | 4900 |
| Fund Agency Code: | 4900 |
| Assistance Listing Number(s): | 47.049, 47.070 |
ABSTRACT
This award focuses on finding paths in certain families of large graphs, called isogeny graphs. Isogeny-based cryptography bases its security on the hardness of path-finding in isogeny graphs, and the path-finding problem is believed to be hard even for quantum computers. Based on this, isogeny-based cryptosystems are believed to be secure even in a post-quantum world. This project will focus on studying the structure of isogeny graphs in order to uncover faster algorithms for computing paths and cycles, leading to a better understanding of the security of isogeny-based cryptosystems. These cryptosystems could one day help secure the modern internet, so a concrete understanding of their security, and hence a concrete understanding of the difficulty of path-finding in isogeny graphs, is imperative. The research component is complemented by educational activities focused on incorporating project-based learning involving programming in undergraduate mathematics courses on number theory and cryptography.
Isogeny-based cryptosystems base their security on the difficulty of computing an isogeny between two given supersingular elliptic curves. Such cryptosystems are attractive for their small public keys and their supposed resistance to quantum attacks. SIKE, the lone isogeny-based KEM in the NIST process, was recently completely broken after over a decade of cryptanalysis, highlighting the necessity of relying on the general isogeny problem instead of a weaker one. The general supersingular isogeny problem is equivalent to the problem of computing the endomorphism ring of a given supersingular elliptic curve. The primary research goal for this project is to design and analyze algorithms for computing the endomorphism ring of a supersingular elliptic curve. The second theme of the project aims to determine the expansion properties of isogeny graphs whose mixing rates have yet to be determined. These generalizations of isogeny graphs could have cryptographic applications so it is important to study their expansion properties.
This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
Please report errors in award information by writing to: awardsearch@nsf.gov.
