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...
Saved in:
Main Authors: | , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2013
|
在線閱讀: | https://hdl.handle.net/10356/95827 http://hdl.handle.net/10220/11376 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
成為第一個發表評論!