Counting Prime Numbers with Short Binary Signed Representation

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

Paper 2006/121

Counting Prime Numbers with Short Binary Signed Representation

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

Metadata

Available format(s): PDF PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: number theory counting primes
Contact author(s): jjangel @ computacion cs cinvestav mx
History: 2006-03-29: received
Short URL: https://ia.cr/2006/121
License: CC BY

BibTeX

@misc{cryptoeprint:2006/121,
      author = {José de Jesús Angel Angel and Guillermo Morales-Luna},
      title = {Counting Prime Numbers with Short Binary Signed Representation},
      howpublished = {Cryptology ePrint Archive, Paper 2006/121},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/121}},
      url = {https://eprint.iacr.org/2006/121}
}