A generalization of Gauss sums and its applications to Siegel modular forms and L-functions associated with the vector space of quadratic forms.
A large family of Boolean functions
In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.
A matrix paraphrase of cyclotomy
A new cubic character sum
A note on evaluations of some exponential sums
1. Introduction. The recent article [1] gives explicit evaluations for exponential sums of the form where χ is a non-trivial additive character of the finite field , odd, and . In my dissertation [5], in particular in [4], I considered more generally the sums S(a,N) for all factors N of . The aim of the present note is to evaluate S(a,N) in a short way, following [4]. We note that our result is also valid for even q, and the technique used in our proof can also be used to evaluate certain...
A note on Waring's problem in finite fields
A note on weight enumerators of linear self-dual codes.
A Stickelberger theorem for p-adic Gauss sums
Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials
We obtain lower bounds on degree and additive complexity of real polynomials approximating the discrete logarithm in finite fields of even characteristic. These bounds complement earlier results for finite fields of odd characteristic.
Arrangements d'hyperplans et sommes de Gauss
Arrangements with one Bounded component and p-adic integrals.