Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields

DOI10.1109/TIT.2011.2180696zbMath1365.11133OpenAlexW2014113567MaRDI QIDQ5271858

Xing, Chaoping, Ignacio Cascudo, An Yang, Ronald Cramer

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2180696

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Complex multiplication and moduli of abelian varieties (11G15)

Related Items (8)

On some bounds for symmetric tensor rank of multiplication in finite fields ⋮ Lower bounds on the class number of algebraic function fields defined over any finite field ⋮ Trisymmetric multiplication formulae in finite fields ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields ⋮ Normal bases on Galois ring extensions

This page was built for publication: Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields