It is shown that under certain hypotheses, irreducibility testing and factorization of polynomials with integer coefficients are polynomial time reducible to primality testing and factorization of… Expand

Fermat’s Last Theorem (FLT) states that x + y = z has no integer solution for n > 2. It is easy to show that if the theorem is true when n equals some integer r, then it is true when n equals any… Expand

Before we look at the MMD calculations in various cases, we prove the following useful characterization of MMD for translation invariant kernels like the Gaussian and Laplace kernels. Lemma 1. For… Expand

We present a review of public key cryptosystems, followed by examples of communications systems which make particularly elegant use of their properties.Expand