Number Theoretic Methods in Cryptography: Complexity lower bounds

by Igor E. Shparlinski

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research.

191 pages, Hardcover

First published February 15, 1999