Vertel uw vrienden over dit artikel:
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
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 8 oktober 2012 |
| Datum oorspronkelijke uitgave | 1999 |
| ISBN13 | 9783034897235 |
| Uitgevers | Springer Basel |
| Pagina's | 182 |
| Afmetingen | 155 × 235 × 10 mm · 285 g |
| Taal en grammatica | Engels |
Meer door Igor Shparlinski
Alles tonenBekijk alles van Igor Shparlinski ( bijv. Paperback Book en Hardcover Book )
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld