Cryptology City

Cryptology City
Home

❯

Reductions

❯

Module SIVP for polynomial factors ⇒ Module SIVP

Nov 21, 2026

Module-SIVP for polynomial factors ⇒ Module-SIVP

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

Statement

If Module-SIVP is hard for polynomial factors, then Module-SIVP is hard for the polynomial-time computable factor γ(N)=N, the case c=1, with the same families n(λ),d(λ) — folklore.


Graph View

  • Module-SIVP for polynomial factors ⇒ Module-SIVP
  • Statement

Backlinks

  • Module lattice problems

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky