ISBN: 9780387772677 - primality testing and integer factorization in public-key cryptography (advances in information security, 11, band 11) (12 Ergebnisse)

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. 392 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: New. pp. 392.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 392 | Sprache: Englisch | Produktart: Bücher | 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.…

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Hardcover. Zustand: Brand New. 2nd edition. 371 pages. 9.50x6.25x1.00 inches. In Stock.