You May Also Like
Sponsored
Sold by Mighty Ape
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.
We are committed to protecting your rights under the Consumer Guarantees Act and working with our suppliers to assist with warranty claims. Products sold by Mighty Ape will be covered by a Manufacturer's Warranty for at least a one-year period from the date of purchase.
Your warranty will cover any manufacturing defects which, if existing, will present themselves within this warranty period.
Your warranty will not cover normal wear and tear, faults caused by misuse, and accidents which cause damage or theft caused after delivery. Using the product in a way it is not designed for will void your warranty.
Please refer to our Help Centre for more information.
