Solinas primes of small weight for fixed sizes

José de Jesús Angel Angel; Guillermo Morales-Luna

Paper 2010/058

Solinas primes of small weight for fixed sizes

José de Jesús 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: prime numbers Solinas primes NIST primes
Contact author(s): jjangel @ computacion cs cinvestav mx
History: 2010-02-08: received
Short URL: https://ia.cr/2010/058
License: CC BY

BibTeX

@misc{cryptoeprint:2010/058,
      author = {José de Jesús Angel Angel and Guillermo Morales-Luna},
      title = {Solinas primes of small weight for fixed sizes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/058},
      year = {2010},
      url = {https://eprint.iacr.org/2010/058}
}