1 Answers
In mathematics, a Solinas prime, or generalized Mersenne prime, is a prime number that has the form f {\displaystyle f} , where f {\displaystyle f} is a low-degree polynomial with small integer coefficients. These primes allow fast modular reduction algorithms and are widely used in cryptography. They are named after Jerome Solinas.
This class of numbers encompasses a few other categories of prime numbers:
10 views
Answered