Solinas prime
id:
solinas-prime-293-13669801
title:
Solinas prime
text:
In mathematics, a Solinas prime, or generalized Mersenne prime, is a prime number that has the form f , where 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: Mersenne primes, which have the form 2 k − 1 ,
Crandall or pseudo-Mersenne primes, which have the form 2 k − c for small odd c
brand slug:
wiki
category slug:
encyclopedia
description:
Prime number of the form that allows fast modular reduction
original url:
https://en.wikipedia.org/wiki/Solinas_prime
date created:
date modified:
2024-04-20T17:45:05Z
main entity:
{"identifier":"Q10747707","url":"https://www.wikidata.org/entity/Q10747707"}
image:
fields total:
13
integrity:
14