All Questions

According to Lemke-Oliver, irreducible quadratic polynomials $G$ with positive leading coefficient and $\rho(2)<2$, (where $\rho(m)$ denotes the number of incongruent solutions to the congruence $G(...

Wilson's theorem states that a natural number $n > 1$ is a prime number if and only if the product of all the positive integers less than $n$ is one less than a multiple of $n$. Is there a version ...

The reason I ask this question is that cyclotomic polynomial is critical to the construction of lattice-based cryptography. In most of the existing lattice-based cryptographic schemes, $n$ is usually ...

Continuation to this previous question. According to Lemke-Oliver, an irreducible polynomial $G$ of degree $g$ with positive leading coefficient and $\Gamma_G\neq0$ (with $\Gamma_G$ a certain factor ...