Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic - Igor Shparlinski - Books - Springer Basel - 9783034897235 - October 8, 2012
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 Softcover reprint of the original 1st ed. 1999 edition

Price
$ 56.49
excl. VAT

Ordered from remote warehouse

Expected delivery Jan 8 - 20, 2026
Christmas presents can be returned until 31 January
Add to your iMusic wish list

Also available as:

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 Books     Paperback Book   (Book with soft cover and glued back)
Released October 8, 2012
Original release date 1999
ISBN13 9783034897235
Publishers Springer Basel
Pages 182
Dimensions 155 × 235 × 10 mm   ·   285 g
Language English  

More by Igor Shparlinski

Show all