## Cryptology ePrint Archive: Report 2010/058

Solinas primes of small weight for fixed sizes

Jos\'e de Jes\'us Angel Angel and Guillermo Morales-Luna

Abstract: We give a list of the Solinas prime numbers of the form $f(2^k)=2^m - 2^n \pm 1$, $m \leq 2000$, with small modular reduction weight $wt < 15$, and $k=8,16,32,64$, i.e., $k$ is a multiple of the computer integer arithmetic word size. These can be useful in the construction of cryptographic protocols.

Category / Keywords: public-key cryptography / prime numbers, Solinas primes, NIST primes

Contact author: jjangel at computacion cs cinvestav mx

Available format(s): PDF | BibTeX Citation

[ Cryptology ePrint archive ]