Skip to content- Sources: paper, discussion
- Summary: The abstract claims provable subexponential secret recovery for problem families tied to all seven lattice candidates from NIST's third round. The stated complexity is subexponential in growing parameter families rather than at deployed sizes. The abstract closes by stating that the results do not establish a reduction in the concrete security of the currently specified parameter sets.
- Why it matters: A migration plan built on Kyber, Dilithium or Falcon has nothing to change on this paper, because the abstract states the currently specified parameter sets are not affected.
- Follow-up: Track peer review and cryptographer analysis of whether the result reaches deployed parameter sets.