Cryptology City

Cryptology City
Home

❯

Reductions

❯

Quantum polynomial factor Module SIVP ⇒ Module SIVP for polynomial factors

Nov 21, 2026

Quantum polynomial-factor Module-SIVP ⇒ Module-SIVP for polynomial factors

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

Statement

If Module-SIVP 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 Module-SIVP ⇒ Module-SIVP for polynomial factors
  • Statement

Backlinks

  • Module lattice problems

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky