Primality Testing And Integer Factorization In Public-key Cryptography (advances In Information Security)

Song Y. Yan,

ISBN 10: 0387772677 / ISBN 13: 9780387772677

Edité par Springer, 2008

A propos de cet article

This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-144600

Détails bibliographiques

Titre : Primality Testing And Integer Factorization ...

Éditeur : Springer

Date d'édition : 2008

Reliure : Couverture rigide

Etat : New

Edition : 2ème Édition

A propos de ce titre

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.