|
Discrete Functions
Construction of a class of functions on finite fields using linear recurrences over Galois rings
A. D. Bugrov Moscow
Abstract:
The paper deals with a class of functions over a finite field $\mathrm{GF}(q)$ constructed on the basis of linear recurring sequences (LRS) over a ring $\mathrm{GR}(q^n,p^n)$ with a distinguished characteristic polynomial. The order of the arguments of the functions in this class is obtained from the set of LRS over the finite field, and the values of the functions are obtained from the complicated LRS over the ring. When some conditions are met, for the proximity $C(f)$ of the studied functions $f$ in $m$ variables to the class of affine functions, the estimate $C(f)\le q^{(m+n-1)/2}(p^{n-1}-1)(q-1)^{1/2}$ is proved. The power of a class of functions and its automaton implementation are also studied.
Keywords:
linear recurring sequences, complication of sequences, finite fields, Galois ring, cross-correlation function, estimation of trigonometric sum.
Citation:
A. D. Bugrov, “Construction of a class of functions on finite fields using linear recurrences over Galois rings”, Prikl. Diskr. Mat. Suppl., 2018, no. 11, 34–39
Linking options:
https://www.mathnet.ru/eng/pdma375 https://www.mathnet.ru/eng/pdma/y2018/i11/p34
|
Statistics & downloads: |
Abstract page: | 202 | Full-text PDF : | 89 | References: | 17 |
|