Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness

by , ,

Image not available

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some ...

Currently there are no copies available. However, our inventory changes frequently. Please check back soon or try Book Fetch.