Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security)

Yan, Song Y.

ISBN 10: 0387772677 / ISBN 13: 9780387772677

Edité par Springer, 2008

A propos de cet article

Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-C-019-01106

Détails bibliographiques

Titre : Primality Testing and Integer Factorization ...

Éditeur : Springer

Date d'édition : 2008

Reliure : Couverture rigide

Etat : Like 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.