
Fortell venner om denne varen:
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic 2003 edition
Igor Shparlinski
Pris
HK$ 835
Bestillingsvarer
Forventes levert 9. - 17. jul
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 2003 edition
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 Innbunden bok (Bok med hard rygg og stivt omslag) |
Utgitt | 11. desember 2002 |
ISBN13 | 9783764366544 |
Utgivere | Birkhauser Verlag AG |
Antall sider | 414 |
Mål | 155 × 235 × 23 mm · 771 g |
Språk | Engelsk |