Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Similars in SciELO
Share
Computación y Sistemas
On-line version ISSN 2007-9737Print version ISSN 1405-5546
Abstract
ANGEL ANGEL, Jose de Jesús and MORALES-LUNA, Guillermo. Searching Prime Numbers with Short Binary Signed Representation. Comp. y Sist. [online]. 2009, vol.12, n.3, pp.322-330. ISSN 2007-9737.
Modular arithmetic with prime moduli has been crucial in present day cryptography. The primes of Mersenne, Solinas, Crandall and the so called IKE-MODP primes have been widely used in efficient implementations. In this paper we study the density of primes with binary signed representation involving a small number of non-zero ±1-digits, and its repercussion in the generation of those primes.
Keywords : Pairing cryptography; prime numbers; signed representation.