Recomienda este artículo a tus amigos:
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic Igor Shparlinski Softcover reprint of the original 1st ed. 1999 edition
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic
Igor Shparlinski
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1.
189 pages, 2 black & white illustrations
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 8 de octubre de 2012 |
| Fecha de lanzamiento original | 1999 |
| ISBN13 | 9783034897235 |
| Editores | Springer Basel |
| Páginas | 182 |
| Dimensiones | 155 × 235 × 10 mm · 285 g |
| Lengua | Inglés |
Mas por Igor Shparlinski
Mostrar todoMere med samme udgiver
Ver todo de Igor Shparlinski ( Ej. Paperback Book y Hardcover Book )