
Tell your friends about this item:
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
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 | 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 |
Show all
More by Igor Shparlinski
See all of Igor Shparlinski ( e.g. Hardcover Book and Paperback Book )