Cryptology City

Cryptology City
Home

❯

Reductions

❯

SIVP for polynomial factors ⇒ SIVP

Nov 21, 2026

SIVP for polynomial factors ⇒ SIVP

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

Statement

Hardness of SIVP for polynomial factors at c=1 is hardness of SIVP for the polynomial-time computable factor γ(n)=n — folklore.


Graph View

  • SIVP for polynomial factors ⇒ SIVP
  • Statement

Backlinks

  • Shortest Independent Vectors Problem

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky