Povej prijatelju o tem izdelku:
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 8. oktobra 2012 |
| Prvotni datum izida | 1999 |
| ISBN13 | 9783034897235 |
| Založniki | Springer Basel |
| Strani | 182 |
| Dimenzije | 155 × 235 × 10 mm · 285 g |
| Jezik | Angleščina |
Več od Igor Shparlinski
Prikaži vseVeč od istega **izdajatelja**
Ogled vseh Igor Shparlinski ( Na primer Paperback Book in Hardcover Book )