Does module-LWE remains hard for an even modulus $q$, or a power of two?
This is true for Ring-LWE (pseudorandomness) and Module-LWR (SABER).
I can't find any reference to it!
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.Sign up to join this community
Yes. Learning with Rounding (LWR) is a special case of LWE, where the errors are introduced deterministically by scaling and rounding operations. If you had an algorithm that could solve LWE, the same could be used to solve LWR.
Thus, Module-LWE is at least as secure as Module-LWR.