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 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 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 and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functio
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
- Publisher
- Birkhäuser
- Published
- 2013
- Language
- EN
- ISBN
- 9783034880374
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Science
Other editions & translations
More by Igor Shparlinski
Browse all works by Igor Shparlinski
Similar books
- Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17) — Igor E. Shparlinski (2012)
- Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes) — Michael Luby (1996)
- Lower Bounds in Communication Complexity: A Survey — Shraibman A. Lee T.
- Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume (Progress in Computer Science and Applied Logic Book 26) — Vikraman Arvind Manindra Agrawal (2014)
- 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)
- Complexity Lower Bounds using Linear Algebra (Foundations and Trends in Theoretical Computer Science) — Satyanarayana V. Lokam (2007)