We give a list of the Solinas prime numbers of the form f(2 k ) = 2 m 2 n ±1, m � 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.
['José de Jesús Angel Angel', 'Guillermo Morales-Luna']
Solinas primes of small weight for fixed sizes