분류 전체보기 1188

Primality Testing and Integer Factorization in Public-Key Cryptography

Publisher: Springer Language: English ISBN: 0387772677 Paperback: 374 pages Description: 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 ..