Progress in Computer Science and Applied Logic: Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Paperback)

The book introduces new techniques that imply rigorous lower bounds on the complexity of some number-theoretic and cryptographic problems.

It also establishes certain attractive pseudorandom properties of various cryptographic primitives.