Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2012. gada 8. oktobris |
| Oriģinālā izdošanas datums | 1999 |
| ISBN13 | 9783034897235 |
| Izdevēji | Springer Basel |
| Lapas | 182 |
| Izmēri | 155 × 235 × 10 mm · 285 g |
| Valoda | Angļu |
Vairāk no Igor Shparlinski
Rādīt visuMere med samme udgiver
Skatīt visus Igor Shparlinski ( piem., Paperback Book un Hardcover Book )