CryptoDB
Paper: Counting Prime Numbers with Short Binary Signed Representation
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2006-21614,
title={Counting Prime Numbers with Short Binary Signed Representation},
booktitle={IACR Eprint archive},
keywords={foundations / number theory, counting primes},
url={http://eprint.iacr.org/2006/121},
note={ jjangel@computacion.cs.cinvestav.mx 13234 received 27 Mar 2006},
author={Jos\'e de Jes\'us Angel Angel and Guillermo Morales-Luna},
year=2006
}