Searching Prime Numbers with Short Binary 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...
Guardado en:
| Publicado en: | Computación y Sistemas |
|---|---|
| Autores principales: | , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Instituto Politécnico Nacional
2009
|
| Materias: | |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=61513252006 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|