## CryptoDB

### Paper: Solinas primes of small weight for fixed sizes

Authors: Jos\'e de Jes\'us Angel Angel Guillermo Morales-Luna URL: http://eprint.iacr.org/2010/058 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2010-22959,
title={Solinas primes of small weight for fixed sizes},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / prime numbers, Solinas primes, NIST primes},
url={http://eprint.iacr.org/2010/058},
note={ jjangel@computacion.cs.cinvestav.mx 14643 received 2 Feb 2010},
author={Jos\'e de Jes\'us Angel Angel and Guillermo Morales-Luna},
year=2010
}