On upper bound of the complexity of quasi polynomial representations of functions over finite fields

zbMATH Open1392.11091MaRDI QIDQ307745FDOQ307745

Authors: Aleksandr Sergeevich Baliuk 

Publication date: 5 September 2016

Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Recommendations

• On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• Lower bounds of complexity for polarized polynomials over finite fields
• Lower bound of the complexity of seven-valued functions in the class of polarized polynomials

zbMATH Keywords

complexityfinite fieldpolynomialquasi polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Cited In (7)

• On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• On the representation of rational functions of bounded complexity
• Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
• Upper bound for the length of functions over a finite field in the class of pseudopolynomials

This page was built for publication: On upper bound of the complexity of quasi polynomial representations of functions over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307745)