Free Download Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan
English | PDF (True) | 2009 | 386 Pages | ISBN : 0387772677 | 5.3 MB
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.
