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: | Cascudo, Ignacio, Cramer, Ronald, Xing, Chaoping, Yang, An |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2013
|
在線閱讀: | https://hdl.handle.net/10356/95827 http://hdl.handle.net/10220/11376 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
The arithmetic codex
由: Cascudo, Ignacio, et al.
出版: (2013) -
Asymptotic bounds on quantum codes from algebraic geometry codes
由: Feng, Keqin, et al.
出版: (2013) -
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
由: Jin, Lingfei, et al.
出版: (2020) -
An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial
由: Kaminski, Michael, et al.
出版: (2013) -
On Secret Sharing with Nonlinear Product Reconstruction
由: Cascudo, Ignacio, et al.
出版: (2015)