Tell your friends about this item:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Softcover reprint of hardcover 2nd ed. 2009 edition
Song Y. Yan
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Softcover reprint of hardcover 2nd ed. 2009 edition
Song Y. Yan
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).
389 pages, 40 black & white illustrations, 10 black & white tables, biography
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | November 29, 2010 |
| ISBN13 | 9781441945860 |
| Publishers | Springer-Verlag New York Inc. |
| Pages | 371 |
| Dimensions | 155 × 235 × 20 mm · 548 g |
| Language | English |
Christmas presents can be returned until 31 January