دانلود کتاب Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness

The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation.Key topics and features:- various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU- a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others- one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving- a number of open problems of different level of difficulty and proposals for further research- an extensive and up-to-date bibliographyCryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills.