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

by Igor E. Shparlinski

Book Overview

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 polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods...

• Format: Paperback
• Language: English
• ISBN: 3034894155
• ISBN13: 9783034894159
• Release Date: October 2013
• Publisher: Birkhauser
• Length: 414 Pages
• Weight: 1.31 lbs.
• Dimensions: 0.9" x 6.1" x 9.2"