Vertel uw vrienden over dit artikel:
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
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 29 november 2010 |
| ISBN13 | 9781441945860 |
| Uitgevers | Springer-Verlag New York Inc. |
| Pagina's | 371 |
| Afmetingen | 155 × 235 × 20 mm · 548 g |
| Taal en grammatica | Engels |
Meer door Song Y. Yan
Alles tonenBekijk alles van Song Y. Yan ( bijv. Hardcover Book en Paperback Book )
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld