NSF award 2521084 · Pennsylvania State Univ University Park

SaTC 2.0: RES: Classical and quantum algorithms for problems in cryptography

Final report due

28 August 2029

in 1,045 days · The award ends on 30 April 2029.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension31 Dec 2028in 805 days
award ending 2029-04-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 Mar 2029in 880 days
award ending 2029-04-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Apr 2029in 915 days
award ending 2029-04-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Aug 2029in 1045 days
award ending 2029-04-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Aug 2029in 1045 days
award ending 2029-04-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Aug 2029in 1045 days
award ending 2029-04-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 April 2029.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 August 2029.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2521084
Period of support: 15 May 2026 – 30 Apr 2029
Amount: $600,000
Awardee: Pennsylvania State Univ University Park, University Park, PA
Program: Secure &Trustworthy Cyberspace
Directorate: CSE

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…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.