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

MaRDI QIDQ307745zbMATH OpenFDO

Authors Aleksandr Sergeevich Baliuk

Publication date 5 September 2016

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

zbMATH Keywords

complexityfinite fieldpolynomialquasi polynomial

Mathematics Subject Classification ID

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

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

Cited in

(7)

• 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 bound for the length of functions over a finite field in the class of pseudopolynomials
• 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
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras

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)