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

Name: Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic
Price: 539 NOK
Availability: OutOfStock
Author: Igor Shparlinski

Pris

NOK 539

Bestillingsvarer

Forventes levert 15. - 23. jul

Kundene våre sier:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

14 dages returrett

Toppvurdering på Trustpilot

Legg til iMusic ønskeliste

eller

Ikke vurdert ennå

Finnes også som:

Innbunden bok

1999 edition

(1999) NOK 649

Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic

Igor Shparlinski

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

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