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

Yan, Song Y.

 
9780387772677: Primality Testing and Integer Factorization in Public-Key Cryptography

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.

Autres éditions populaires du même titre

9781402076497: Primality Testing and Integer Factorization in Public-Key Cryptography

Edition présentée

ISBN 10 :  1402076495 ISBN 13 :  9781402076497
Editeur : Kluwer Academic Publishers, 2004
Couverture rigide