NSF award 2611676 · Yeshiva University

SaTC: CORE: Small: Lattices, number theory, and distribution questions in cryptography

Final report due

30 April 2027

in 194 days · The award ends on 31 December 2026.

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

Dates this award owes

NSF emails you about this too.

Extension request16 Nov 2026in 29 days
award ending 2026-12-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 Dec 2026in 64 days
award ending 2026-12-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due30 Apr 2027in 194 days
award ending 2026-12-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due30 Apr 2027in 194 days
award ending 2026-12-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out30 Apr 2027in 194 days
award ending 2026-12-31 · 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 31 December 2026.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 30 April 2027.

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: 2611676
Period of support: 1 Jan 2026 – 31 Dec 2026
Amount: $500,000
Awardee: Yeshiva University, NEW York, NY
Program: Secure &Trustworthy Cyberspace
Directorate: CSE

Abstract

Modern cryptography faces the serious concern that quantum computers will one day break most of our presently-used cryptosystems. This would have catastrophic consequences to internet security and privacy. As a result, it is very important to develop and understand newer types of potentially quantum-resistant cryptosystems. Cryptosystems based on the mathematical notion of Euclidean lattices are presently the…

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.