Paper Info
Title
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.
Abstract
In 1986, D. V. Chudnovsky and G. V. Chudnovsky first employed algebraic curves over finite fields to construct bilinear multiplication algorithms implicitly through supercodes introduced by Shparlinski–Tsfasman–Vladuţ, or equivalently, multiplication-friendly codes that we will introduce in this paper. This idea was further developed by Shparlinski–Tsfasman–Vladuţ in order to study the asymptotic behavior of multiplication complexity in extension fields. Later on, Ballet et al. further investigated the method and obtained some improvements. Recently, Ballet and Pieltant made use of curves over an extension field of ${\\BBF}_{2}$ to obtain an improvement on the complexity of multiplications in extensions of the binary field. In this paper, we develop the multiplication-friendly splitting technique and then apply this technique to study asymptotic behavior of multiplications in extension fields. By combining this with the idea of using algebraic function fields, we are able to improve further the asymptotic results of multiplication complexity. In particular, the improvement for small fields such as the binary and ternary fields is substantial.
Year
DOI
Venue
2012
10.1109/TIT.2011.2180696
IEEE Transactions on Information Theory
Keywords
Field
DocType
upper bound,algebraic curve,algebraic curves,complex multiplication,codes,complexity,vectors,finite field,indexation,indexes,kernel,algebraic function
Discrete mathematics,Combinatorics,Finite field,Multiplication algorithm,Algebra,Upper and lower bounds,Algebraic curve,Algebraic function,Multiplication,Asymptotic analysis,Mathematics,Binary number
Journal
Volume
Issue
ISSN
58
7
0018-9448
Citations 
PageRank 
References 
7
0.62
6
Authors
4
Name
Order
Citations
PageRank
Ignacio Cascudo Pueyo111811.41
Ronald Cramer22499178.28
Chaoping Xing3916110.47
An Yang470.62