Asymptotic bound for multiplication complexity in the extensions of small finite fields

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 pap...

Full description

Saved in:
Bibliographic Details
Main Authors: Cascudo, Ignacio, Cramer, Ronald, Xing, Chaoping, Yang, An
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2013
Online Access:https://hdl.handle.net/10356/95827
http://hdl.handle.net/10220/11376
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first