Articles liés à Primality Testing and Integer Factorization in Public-Key...

Primality Testing and Integer Factorization in Public-Key Cryptography - Couverture rigide

Livre 59 sur 109: Advances in Information Security

Yan, Song Y.

 
9780387772677: Primality Testing and Integer Factorization in Public-Key Cryptography
Couverture rigide
ISBN 10 : 0387772677 ISBN 13 : 9780387772677
Editeur : Springer-Verlag New York Inc., 2008

Synopsis

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.

This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Springer-Verlag New York Inc.
Date d'édition
2008
Langue
anglais
ISBN 10 
0387772677
ISBN 13 
9780387772677
Reliure
Relié
Numéro d'édition
2
Nombre de pages
389
Coordonnées du fabricant
ProductSafety@springernature.com
ProductSafety@springernature.com

Tiergartenstr. 17
Heidelberg
69121
Allemagne