Cryptology City

Cryptology City
Home

❯

Reductions

❯

Ideal SVP for polynomial factors ⇒ Ideal SVP

Nov 21, 2026

Ideal-SVP for polynomial factors ⇒ Ideal-SVP

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

Statement

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


Graph View

  • Ideal-SVP for polynomial factors ⇒ Ideal-SVP
  • Statement

Backlinks

  • Ideal Shortest Vector Problem

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky