Module-SIVP for polynomial factors ⇒ Module-SIVP
Statement
If Module-SIVP is hard for polynomial factors, then Module-SIVP is hard for the polynomial-time computable factor , the case , with the same families — folklore.
If Module-SIVP is hard for polynomial factors, then Module-SIVP is hard for the polynomial-time computable factor , the case , with the same families — folklore.