{"product_id":"primality-testing-and-integer-factorization-in-public-key-cryptography-advances-in-information-security-11-0387772677","title":"Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)","description":"\u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 0387772677\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Yan, Song Y.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e New\u003c\/p\u003e\u003cp\u003eThe 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.\u003c\/p\u003e","brand":"Mia Karts","offers":[{"title":"Default Title","offer_id":51823871557920,"sku":"NEW0387772677","price":136.84,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0980\/7426\/3840\/files\/61EBkQNjFvL.jpg?v=1781204312","url":"https:\/\/miakarts.com\/products\/primality-testing-and-integer-factorization-in-public-key-cryptography-advances-in-information-security-11-0387772677","provider":"Miakarts Books","version":"1.0","type":"link"}