Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic - Igor Shparlinski - Bøger - Springer Basel - 9783034894159 - 3. oktober 2013
Ved uoverensstemmelse mellem cover og titel gælder titel

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
Kč 2.865

Bestilles fra fjernlager

Forventes klar til forsendelse 9. - 15. jul.
Tilføj til din iMusic ønskeseddel
Eller

Findes 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

Medie Bøger     Paperback Bog   (Bog med blødt omslag og limet ryg)
Udgivet 3. oktober 2013
ISBN13 9783034894159
Forlag Springer Basel
Antal sider 414
Mål 155 × 235 × 22 mm   ·   594 g
Sprog Engelsk  

Vis alle

Mere med Igor Shparlinski