Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic - Igor Shparlinski - Bøker - Springer Basel - 9783034894159 - 3. oktober 2013
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 2003 edition

Igor Shparlinski

Pris
£ 78,99

Bestillingsvarer

Forventes levert 11. - 21. 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 Softcover reprint of the original 1st ed. 2003 edition

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  

Vis alle

Mer med Igor Shparlinski