
Tell your friends about this item:
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 2003 edition
Igor Shparlinski
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 2003 edition
Igor Shparlinski
The book introduces new techniques that imply rigorous lower bounds on the com plexity 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.
414 pages, biography
Media | Books Paperback Book (Book with soft cover and glued back) |
Released | October 3, 2013 |
ISBN13 | 9783034894159 |
Publishers | Springer Basel |
Pages | 414 |
Dimensions | 155 × 235 × 22 mm · 594 g |
Language | English |
Show all
More by Igor Shparlinski
See all of Igor Shparlinski ( e.g. Hardcover Book and Paperback Book )