English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/8843
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
Ver citas en Google académico
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar otros formatos: Exportar EndNote (RIS)Exportar EndNote (RIS)Exportar EndNote (RIS)
Título

How strong are strong primes? A proposal of test

Autor Durán Díaz, Raúl; Muñoz Masqué, Jaime
Palabras clave Strong Primes Optimality
Strong Primes
Gordon algorithm
RSA Cryptosystem
TCP/IP Protocols Security
Fecha de publicación jul-2001
EditorInternational Institute of Informatics and Systemics
Institute of Electrical and Electronics Engineers
Citación 5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001) ; IS0051302
ResumenAfter revisiting a number of Internet protocols whose security rests on the RSA cryptosystem, we bring about the discussion on the necessity of using special primes for it to work at the best possible level of security. We propose and discuss a property of integer numbers that permits the characterization of a set of special primes particulary well suited for the RSA cryptosystem.
Descripción 4 pages.-- Communication presented at the 5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001, Orlando, Florida, Jul 22-25, 2001).
URI http://hdl.handle.net/10261/8843
ISBN 980-07-7529-3
Aparece en las colecciones: (IFA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
IS0051302.pdf1,42 MBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.