Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorShparlinski, Igor. author
TitleNumber Theoretic Methods in Cryptography [electronic resource] : Complexity lower bounds / by Igor Shparlinski
ImprintBasel : Birkhรคuser Basel : Imprint: Birkhรคuser, 1999
Connect to
Descript IX, 182 p. online resource


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. We obtain several lower bounds, exponential in terms of logp, on the deยญ grees and orders of โ{128}ข polynomials; โ{128}ข algebraic functions; โ{128}ข Boolean functions; โ{128}ข linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at sufยญ ficiently many points (the number of points can be as small as pI/He). 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 rightยญ most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the deยญ gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size


I Preliminaries -- 1 Introduction -- 2 Basic Notation and Definitions -- 3 Auxiliary Results -- II Approximation and Complexity of the Discrete Logarithm -- 4 Approximation of the Discrete Logarithm Modulo p -- 5 Approximation of the Discrete Logarithm Modulo p โ{128}{148} 1 -- 6 Approximation of the Discrete Logarithm by Boolean Functions -- 7 Approximation of the Discrete Logarithm by Real and Complex Polynomials -- III Complexity of Breaking the Diffie-Hellman Cryptosystem -- 8 Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Key -- 9 Boolean Complexity of the Diffie-Hellman Key -- IV Other Applications -- 10 Trade-off between the Boolean and Arithmetic Depths of Modulo p Functions -- 11 Special Polynomials and Boolean Functions -- 12 RSA and Blum-Blum-Shub Generators of Pseudo-Random Numbers -- V Concluding Remarks -- 13 Generalizations and Open Questions -- 14 Further Directions

Mathematics Data structures (Computer science) Data encryption (Computer science) Computers Number theory Mathematics Number Theory Data Encryption Theory of Computation Data Structures Cryptology and Information Theory


Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network


facebook   instragram