Opening book details…
Can I read Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic, 22) on EtoBox?
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic, 22) by Igor Shparlinski (auth.), Igor Shparlinski (eds.) is a nonfiction available to read on EtoBox.
What is Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic, 22) about?
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 bibliography Cryptographers 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 app
Who reads Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness (Progress in Computer Science and Applied Logic, 22)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Igor Shparlinski (auth.), Igor Shparlinski (eds.)
- Publisher
- Birkhäuser Basel; Imprint: Birkhäuser
- Published
- 2003
- Language
- EN
- ISBN
- 9783034880374
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Science
Other editions & translations
More by Igor Shparlinski (auth.), Igor Shparlinski (eds.)
Browse all works by Igor Shparlinski (auth.), Igor Shparlinski (eds.)
Similar books
- Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17) — Igor E. Shparlinski (2012)
- Lower Bounds in Communication Complexity: A Survey — Shraibman A. Lee T.
- Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes) — Michael Luby (1996)
- Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume (Progress in Computer Science and Applied Logic Book 26) — Vikraman Arvind Manindra Agrawal (2014)
- Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671) — Shafi Goldwasser Daniele Micciancio (2002)
- Cryptography and Computational Number Theory (Progress in Computer Science and Applied Logic, 20) — Cesar Alonso, Jaime Gutierrez, Rosario Rubio (auth.), Kwok-Yan Lam, Igor Shparlinski, Huaxiong Wang, Chaoping Xing (2001)
