Distribution of Modular Sums and the Security of the Server Aided Exponentiation

Abstract

We obtain some uniformity of distribution results for the values of modular sums of the form

$$\sum\limits_{j = 1}^n {a_j x_j } \left( {\bmod M} \right)\left( {x_1 , \ldots ,x_n } \right) \in \beta $$

where M ≥ 1 is an integer, a₁,…, a_n are elements of the residue ring modulo M, selected unformly at random, and β is an arbitrary set of n-dimensional integer vectors. In some partial cases, for very special sets β, some results of this kind have been known, however our estimates are more precise and more general. Our technique is based on fairly simple properties of exponential sums. We also give cryptographic applications of some of these results. In particular, we consider an extension of a pseudo-random number generator due to V. Boyko, M. Peinado and R Venkatesan, and establish the security of some discrete logarithm based signature schemes making use of this generator (in both its original and extended forms). One of these schemes, which uses precomputation is well known. The other scheme which uses server aided computation, seems to be new. We show that for a certain choice of parameters one can guarantee an essential speed-up of both of these schemes without compromising the security (compared to the traditional discrete logarithm based signature scheme).