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


Higher-order safe primes with negative signature: an algorithmic approach

AuthorsDurán Díaz, Raúl; Hernández Encinas, Luis; Muñoz Masqué, Jaime
KeywordsDistribution of safe primes
Safe-prime signature
Chains of primes
Hardy-Littlewood and Bateman-Horn conjectures
Public Key Cryptography
Issue Date2009
PublisherUnion of Scientists in Bulgaria
CitationInternational Journal on Information Technologies & Security 1: 13-24 (2009)
AbstractFirst, the definition and basic properties of higher-order safe primes are presented along with an explicit formula to compute the density of this class of primes in the set of the integers. Then the concept of generalised safe primes is presented and formulae are introduced to compute the density of this type of primes for the special case of the negative signatures.
Description12 pages, no figures.
Appears in Collections:(IFA) Artículos
Files in This Item:
File Description SizeFormat 
IJITS_DHM.pdf147,73 kBAdobe PDFThumbnail
Show full item record
Review this work

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