English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/8843
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:

Title

How strong are strong primes? A proposal of test

AuthorsDurán Díaz, Raúl; Muñoz Masqué, Jaime
KeywordsStrong Primes Optimality
Strong Primes
Gordon algorithm
RSA Cryptosystem
TCP/IP Protocols Security
Issue DateJul-2001
PublisherInternational Institute of Informatics and Systemics
Institute of Electrical and Electronics Engineers
Citation5th World Multiconference on Systemics, Cybernetics and Informatics and 7th International Conference on Information System Analysis and Synthesis (SCI/ISAS 2001) ; IS0051302
AbstractAfter 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.
Description4 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).
URIhttp://hdl.handle.net/10261/8843
ISBN980-07-7529-3
Appears in Collections:(IFA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
IS0051302.pdf1,42 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.