Primality Testing and Integer Factorization in Public-Key Cryptography

Available
0
StarStarStarStarStar
0Reviews

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 compu...

Read more
E-book
pdf
Price
129.50 £

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 compu...

Read more
Follow the Author

Options

  • Formats: pdf
  • ISBN: 9780387772684
  • Publication Date: 3 Apr 2009
  • Publisher: Springer US
  • Product language: English
  • Drm Setting: DRM