Cryptology City

Cryptology City
Home

❯

Reductions

❯

GapSVP for polynomial factors ⇒ GapSVP

Oct 20, 2026

GapSVP for polynomial factors ⇒ GapSVP

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

Hardness of GapSVP for polynomial factors is worst-case hardness of GapSVP for one family of approximation factors, γ=nc — folklore.


Graph View

  • GapSVP for polynomial factors ⇒ GapSVP
  • Statement

Backlinks

  • Shortest Vector Problem

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky