Paper 2006/121 Original: eprint.iacr.org/2006/121 ↗
Counting Prime Numbers with Short Binary Signed Representation
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- Category
- Foundations
- Publication info
- Preprint.
- History
- 2006-03-29: last updated
- 2006-03-29: published
- Short URL
- https://ia.cr/2006/121
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2006/121}
}