Number Theoretic Methods in Cryptography

Complexity lower bounds

Autori

• Igor Shparlinski

Parametri

• 198 pagine
• 7 ore di lettura

• Computer, IT, programmazione
• Matematica

Maggiori informazioni sul libro

Focusing on advanced number theory and cryptography, this book presents innovative techniques that establish rigorous lower bounds on the complexity of various mathematical problems. It explores character sums and polynomial equation solutions over finite fields and residue rings, offering significant findings on -polynomials, algebraic functions, and Boolean functions. The text delves into the implications of these results for computing the discrete logarithm, particularly emphasizing the role of quadratic residues and providing insights into the complexity of Boolean circuits. Open problems and research proposals are also included.

Lingua: Inglese

Pubblicato: 2012

(In brossura)