Recomienda este artículo a tus amigos:
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security Song Y. Yan Softcover reprint of hardcover 2nd ed. 2009 edition
Primality Testing and Integer Factorization in Public-Key Cryptography - Advances in Information Security
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 29 de noviembre de 2010 |
| ISBN13 | 9781441945860 |
| Editores | Springer-Verlag New York Inc. |
| Páginas | 371 |
| Dimensiones | 155 × 235 × 20 mm · 548 g |
| Lengua | Inglés |
Los regalos de Navidad se podrán canjear hasta el 31 de enero