Fortell venner om denne varen:
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic Igor Shparlinski Softcover reprint of the original 1st ed. 2003 edition
Pris
NOK 1.089
Bestillingsvarer
Forventes levert 10. - 18. des
Julegaver kan byttes frem til 31. januar
Legg til iMusic ønskeliste
eller
Finnes også som:
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic
Igor Shparlinski
The book introduces new techniques that imply rigorous lower bounds on the com plexity 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.
414 pages, biography
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 3. oktober 2013 |
| ISBN13 | 9783034894159 |
| Utgivere | Springer Basel |
| Antall sider | 414 |
| Mål | 155 × 235 × 22 mm · 594 g |
| Språk | Engelsk |