Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Quick and Easy Sign Up!

It takes less then 1 minute to sign up, then you can enjoy Unlimited eBooks.

Sign Up Browse

Popular Genres

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

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

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

Igor E. Shparlinski
0/5 ( ratings)
Read Download
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 . These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue."
Language
English
Pages
414
Format
Hardcover
Publisher
Birkhauser
Release
December 11, 2002
ISBN
3764366540
ISBN 13
9783764366544

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

Igor E. Shparlinski
0/5 ( ratings)
Read Download
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 . These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue."
Language
English
Pages
414
Format
Hardcover
Publisher
Birkhauser
Release
December 11, 2002
ISBN
3764366540
ISBN 13
9783764366544

More books from Igor E. Shparlinski

Cryptography and Computational Number Theory

2/5 ( ratings)

Finite Fields: Theory and Applications: Ninth International Conference on Finite Fields and Applications, July 13-17, 2009, Dublin, Ireland

2/5 ( ratings)

Number Theoretic Methods in Cryptography: Complexity Lower Bounds (Progress in Computer Science and Applied Logic (PCS))

2/5 ( ratings)

Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

2/5 ( ratings)

Recurrence Sequences

2/5 ( ratings)

Rate this book!

Write a review?

loader