Results 61 to 70 of about 127,631 (176)
On random polynomials over finite fields [PDF]
, 2017 We consider random monic polynomials of degree n over a finite field of q elements, chosen with all qn possibilities equally likely, factored into monic irreducible factors.
Arratia, Richard +2 more
core
ITERATION OF QUADRATIC POLYNOMIALS OVER FINITE FIELDS [PDF]
Mathematika, 2017 For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX^2+c$, starting at $0$, always recurs after $O(q/\log\log q)$ steps. For $X^2+1$ the same is true for any starting value. We suggest that the traditional "Birthday Paradox" model is inappropriate for iterates of $X^3+c$, when $q$ is 2 mod 3.
openaire +3 more sources
Quantitative bounds for the $U^4$-inverse theorem over low characteristic finite fields
Discrete Analysis, 2022 Quantitative bounds for the $U^4$-inverse theorem over low characteristic finite fields, Discrete Analysis 2022:14, 17 pp. Let $G$ be a finite Abelian group and let $f$ be a complex-valued function defined on $G$.
Jonathan Tidor
doaj +1 more source
Upper Bounds of the Complexity of Functions over Finite Fields in Some Classes of Kroneker Forms
Известия Иркутского государственного университета: Серия "Математика", 2015 Polynomial representations of Boolean functions have been studied well enough. Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased.
A.S. Baliuk, G.V. Yanushkovsky
doaj
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2020 The possibility of constructing a full-parametric analytical solution of the stress-strain state problem for the body caused by the influence of volumetric forces is studied.
Viktor Borisovich Pen'kov +2 more
doaj +1 more source
Известия Иркутского государственного университета: Серия "Математика", 2016 The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +1 more source
On Upper Bound of the Complexity of Quasi Polynomial Representations of Functions over Finite Fields
Известия Иркутского государственного университета: Серия "Математика", 2014 Representations of functions over finite fields, including polynomial representations, are being actively investigated. The complexity of such representations is one of main directions of research.
A.S. Baliuk
doaj
Известия Иркутского государственного университета: Серия "Математика", 2016 Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased. Complexity of those representations is widely studied.
A. Kazimirov, S. Reymerov
doaj
Efficient evaluation of polynomials over finite fields
, 2011 A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is ...
Elia, Michele +2 more
core