[Resource Topic] 2006/121: Counting Prime Numbers with Short Binary Signed Representation

Welcome to the resource topic for 2006/121

Title:
Counting Prime Numbers with Short Binary Signed Representation

Authors: José de Jesús Angel Angel, Guillermo Morales-Luna

Abstract:

Modular arithmetic with prime moduli has been crucial in
present day cryptography. The primes of Mersenne, Solinas,
Crandall and the so called IKE-MODP have been extensively used
in efficient implementations.
In this paper we study the density of primes with binary
signed representation involving a small number of non-zero \pm 1-digits.

ePrint: https://eprint.iacr.org/2006/121

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .