SciELO - Scientific Electronic Library Online

vol.12 issue3Algebraic Immunity of Boolean Functions - Analysis and ConstructionHardware Architecture and Cost/time/data Trade-off for Generic Inversion of One-Way Function author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Computación y Sistemas

Print version ISSN 1405-5546


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 1405-5546.

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.

        · abstract in Spanish     · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License