Some mathematical patterns are so subtle you could search for a lifetime and never find them. Others are so common that they seem impossible to avoid. A new proof by Sarah Peluse of the University of ...

The computational manipulation of polynomials is a foundational element across pure and applied mathematics, computer algebra, cryptography and scientific computing. Central tasks include ...

We propose a new quantum-safe digital signature algorithm called Multivariate Polynomial Public Key Digital Signature (MPPK/DS). The core of the algorithm is based on the modular arithmetic property ...

The twin primes conjecture is one of the most important and difficult questions in mathematics. Two mathematicians have solved a parallel version of the problem for small number systems. On September ...