Del 11 - Advances in Information Security
Primality Testing and Integer Factorization in Public-Key Cryptography
Häftad, Engelska, 2010
Av Song Y. Yan
2 109 kr
Beställningsvara. Skickas inom 7-10 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.Finns i fler format (1)
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.
Produktinformation
- Utgivningsdatum2010-11-29
- Mått155 x 235 x 22 mm
- Vikt593 g
- SpråkEngelska
- SerieAdvances in Information Security
- Antal sidor371
- Upplaga2
- FörlagSpringer-Verlag New York Inc.
- EAN9781441945860