Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic - Igor Shparlinski - Bøger - Springer Basel - 9783034897235 - 8. oktober 2012
Ved uoverensstemmelse mellem cover og titel gælder titel

Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition

Igor Shparlinski

Pris
S$ 88,75

Bestilles fra fjernlager

Forventes klar til forsendelse 8. - 14. jul.
Tilføj til din iMusic ønskeseddel
Eller

Findes også som:

Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition

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.


189 pages, 2 black & white illustrations

Medie Bøger     Paperback Bog   (Bog med blødt omslag og limet ryg)
Udgivet 8. oktober 2012
Oprindeligt udgivet 1999
ISBN13 9783034897235
Forlag Springer Basel
Antal sider 182
Mål 155 × 235 × 10 mm   ·   285 g
Sprog Engelsk  

Vis alle

Mere med Igor Shparlinski