Worst-case to average-case reductions for module lattices

It is proved that these average-case problems are at least as hard as standard lattice problems restricted to module lattices (which themselves bridge arbitrary and ideal lattices) as these new problems enlarge the toolbox of the lattice-based cryptographer and could prove useful for designing new schemes.