Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic - Igor Shparlinski - Books - Birkhauser Verlag AG - 9783764358884 - February 15, 1999
In case cover and title do not match, the title is correct

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

Igor Shparlinski

Price
Fr. 53.99
excl. VAT

Ordered from remote warehouse

Expected delivery Jul 16 - 29
Add to your iMusic wish list

Also available as:

Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic 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.


182 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released February 15, 1999
ISBN13 9783764358884
Publishers Birkhauser Verlag AG
Pages 182
Dimensions 155 × 235 × 12 mm   ·   408 g
Language English  

Show all

More by Igor Shparlinski