
Fortell venner om denne varen:
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
NOK 559
Bestillingsvarer
Forventes levert 9. - 17. jul
Legg til iMusic ønskeliste
Eller
Finnes 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
Igor Shparlinski
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
Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
Utgitt | 8. oktober 2012 |
Opprinelig utgitt | 1999 |
ISBN13 | 9783034897235 |
Utgivere | Springer Basel |
Antall sider | 182 |
Mål | 155 × 235 × 10 mm · 285 g |
Språk | Engelsk |