@inproceedings{f30ee12a96064c1fa314e888bff5599e,

title = "Communication complexity and fourier coefficients of the Diffie-Hellman key",

abstract = "Let p be a prime and let g be a primitive root of the field IFp of p elements. In the paper we show that the communication complexity of the last bit of the Diffie-Hellman key gxy, is at least n/24 + o(n) where x and y are n-bit integers where n is defined by the inequalities 2n ≤ p ≤ 2n+1 - 1. We also obtain a nontrivial upper bound on the Fourier coefficients of the last bit of gxy. The results are based on some new bounds of exponential sums with gxy.",

author = "Shparlinski, {Igor E.}",

year = "2000",

doi = "10.1007/10719839_27",

language = "English",

isbn = "3540673067",

volume = "1776 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "259--268",

editor = "Gaston Gonnet and Daniel Panario and Alfredo Viola",

booktitle = "LATIN 2000: Theoretical Informatics - 4th Latin American Symposium, Proceedings",

address = "United States",

note = "4th Latin American Symposium on Theoretical Informatics, LATIN 2000 ; Conference date: 10-04-2000 Through 14-04-2000",

}