
Fortell venner om denne varen:
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic 1999 edition
Igor Shparlinski
Pris
Ft 23.016
Bestillingsvarer
Forventes levert 11. - 22. jul
Legg til iMusic ønskeliste
Eller
Finnes også som:
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic 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.
182 pages, biography
Media | Bøker Innbunden bok (Bok med hard rygg og stivt omslag) |
Utgitt | 15. februar 1999 |
ISBN13 | 9783764358884 |
Utgivere | Birkhauser Verlag AG |
Antall sider | 182 |
Mål | 155 × 235 × 12 mm · 408 g |
Språk | Engelsk |