Povej prijatelju o tem izdelku:
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic Igor Shparlinski 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.
182 pages, biography
| Medij | Knjige Hardcover Book (Knjiga s trdim hrbtom in platnicami) |
| Izdano | 15. februarja 1999 |
| ISBN13 | 9783764358884 |
| Založniki | Birkhauser Verlag AG |
| Strani | 182 |
| Dimenzije | 155 × 235 × 12 mm · 408 g |
| Jezik | Angleščina |