Ian F. Blake, Theo Garefalakis, “On the complexity of the discrete logarithm and Diffie–Hellman problems”, Journal of Complexity, 20, № 2-3, 2004, 148
John B. Friedlander, 237, Equidistribution in Number Theory, An Introduction, 2006, 29
Céline Chevalier, Pierre-Alain Fouque, David Pointcheval, Sébastien Zimmer, 5479, Advances in Cryptology - EUROCRYPT 2009, 2009, 572
Eike Kiltz, Hans Ulrich Simon, “Threshold circuit lower bounds on cryptographic functions”, Journal of Computer and System Sciences, 71, № 2, 2005, 185
Igor E. Shparlinski, Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, 209
Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski, 2442, Advances in Cryptology — CRYPTO 2002, 2002, 433
Mei-Chu Chang, Chui Zhi Yao, “An Explicit Bound On Double Exponential Sums Related to Diffie–Hellman Distributions”, SIAM J. Discrete Math., 22, № 1, 2008, 348
J. Bourgain, “On an exponential sum related to the Diffie-Hellman cryptosystem”, International Mathematics Research Notices, 2006
Igor E. Shparlinski, “Exponential Function Analogue of Kloosterman Sums”, Rocky Mountain J. Math., 34, № 4, 2004
J. Bourgain, Perspectives in Analysis, 2005, 17