bokomslag Primality Testing and Integer Factorization in Public-Key Cryptography
Data & IT

Primality Testing and Integer Factorization in Public-Key Cryptography

Song Y Yan

Inbunden

2249:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 371 sidor
  • 2008
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.
  • Författare: Song Y Yan
  • Illustratör: 20 schw-w Abb
  • Format: Inbunden
  • ISBN: 9780387772677
  • Språk: Engelska
  • Antal sidor: 371
  • Utgivningsdatum: 2008-12-02
  • Förlag: Springer-Verlag New York Inc.