Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-26T07:53:21.469Z Has data issue: false hasContentIssue false
  • English
  • Français

Incomplete exponential sums and Diffie–Hellman triples

Published online by Cambridge University Press:  22 February 2006

WILLIAM D. BANKS ,
JOHN B. FRIEDLANDER ,
SERGEI V. KONYAGIN  and
IGOR E. SHPARLINSKI
WILLIAM D. BANKS
Affiliation:
Department of Mathematics, University of Missouri, Columbia, MO 65211, U.S.A. e-mail: [email protected]
JOHN B. FRIEDLANDER
Affiliation:
Department of Mathematics, University of Toronto, Toronto, Ontario M5S 3G3, Canada. e-mail: [email protected]
SERGEI V. KONYAGIN
Affiliation:
Department of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia. e-mail: [email protected]
IGOR E. SHPARLINSKI
Affiliation:
Department of Computing, Macquarie University, Sydney, NSW 2109, Australia. e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Let $p$ be a prime and $\vartheta$ an integer of order $t$ in the multiplicative group modulo $p$. In this paper, we continue the study of the distribution of Diffie–Hellman triples$(\vartheta^x, \vartheta^y, \vartheta^{xy})$ by considering the closely related problem of estimating exponential sums formed from linear combinations of the entries in such triples. We show that the techniques developed earlier for complete sums can be combined, modified and developed further to treat incomplete sums as well. Our bounds imply uniformity of distribution results for Diffie–Hellman triples as the pair $(x,y)$ varies over small boxes.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 140 , Issue 2 , March 2006 , pp. 193 - 206
Copyright
2006 Cambridge Philosophical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)