Searching Prime Numbers with Short Binary Signed Representation
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Instituto Politécnico Nacional
2009
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876436750365097984 |
|---|---|
| author | Jose de Jesús Angel Angel |
| author_facet | Jose de Jesús Angel Angel |
| contents | Searching Prime Numbers with Short Binary Signed Representation Jose de Jesús Angel Angel Guillermo Morales-Luna Computación prime numbers Pairing cryptography signed representation 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. 2009 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61513252006 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.12 |
| format | Artículo científico |
| id | redalyc_61513252006 |
| institution | Redalyc |
| language | en |
| publishDate | 2009 |
| publisher | Instituto Politécnico Nacional |
| spellingShingle | Searching Prime Numbers with Short Binary Signed Representation Jose de Jesús Angel Angel Computación prime numbers Pairing cryptography signed representation Searching Prime Numbers with Short Binary Signed Representation Jose de Jesús Angel Angel Guillermo Morales-Luna Computación prime numbers Pairing cryptography signed representation 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. 2009 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61513252006 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.3 Vol.12 |
| title | Searching Prime Numbers with Short Binary Signed Representation |
| topic | Computación prime numbers Pairing cryptography signed representation |
| url | https://www.redalyc.org/articulo.oa?id=61513252006 |