Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions (Q2773333)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions |
scientific article; zbMATH DE number 1709924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions |
scientific article; zbMATH DE number 1709924 |
Statements
Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions (English)
0 references
21 February 2002
0 references
lower bounds
0 references
degree
0 references
sparsity
0 references
Boolean function
0 references
discrete logarithm
0 references
The paper provides lower bounds on the degree and the sparsity of a Boolean function representing the rightmost bit of the discrete logarithm for almost all nonzero elements of a finite field. The proofs are based on a new upper bound for incomplete character sums over finite fields, which is established by a method due to \textit{H. Niederreiter} and \textit{I. E. Shparlinski} [Math. Comput. 70, 1569-1574 (2001; Zbl 0983.11048)].
0 references
