Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / number theory, counting primes

Date: received 27 Mar 2006

Contact author: jjangel at computacion cs cinvestav mx

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20060329:194243 (All versions of this report)

Short URL: ia.cr/2006/121

Discussion forum: Show discussion | Start new discussion