Cryptology City

Cryptology City
Home

❯

Reductions

❯

Quantum polynomial factor Ideal SVP ⇒ Ideal SVP for polynomial factors

Nov 21, 2026

Quantum polynomial-factor Ideal-SVP ⇒ Ideal-SVP for polynomial factors

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

Statement

If Ideal-SVP is quantumly hard for polynomial factors, it is hard for polynomial factors, since a polynomial-time quantum algorithm simulates every probabilistic polynomial-time classical algorithm with the same output distribution — folklore.


Graph View

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

Backlinks

  • Ideal Shortest Vector Problem

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky