I am wondering why the modulus $q$ in the LWE problem has to be polynomial in $n$.
Another question is whether one can take it to be an arbitrary integer instead of a prime number.
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 communityI am wondering why the modulus $q$ in the LWE problem has to be polynomial in $n$.
Another question is whether one can take it to be an arbitrary integer instead of a prime number.
I think the answer is in the document you've found the recommendation : "Choosing an exponential modulus $q$ has the disadvantage of significantly increasing the size of the input."