Complexity of polynomial multiplication over finite fields

被引：0
|
作者：
Kaminski, Michael [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2006年 / 3967卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：2 / 2
页数：1
相关论文
共 50 条
  • [1] MULTIPLICATIVE COMPLEXITY OF POLYNOMIAL MULTIPLICATION OVER FINITE-FIELDS
    KAMINSKI, M
    BSHOUTY, NH
    JOURNAL OF THE ACM, 1989, 36 (01) : 150 - 170
  • [2] A lower bound on the complexity of polynomial multiplication over finite fields
    Kaminski, M
    SIAM JOURNAL ON COMPUTING, 2005, 34 (04) : 960 - 992
  • [3] A lower bound on the complexity of polynomial multiplication over finite fields
    Kaminski, M
    STACS 2005, PROCEEDINGS, 2005, 3404 : 485 - 495
  • [4] Faster Polynomial Multiplication over Finite Fields
    Harvey, David
    van der Hoeven, Joris
    Lecerf, Gregoire
    JOURNAL OF THE ACM, 2017, 63 (06)
  • [5] Polynomial multiplication over finite fields: From quadratic to straight-line complexity
    Bshouty, Nader H.
    Kaminski, Michael
    COMPUTATIONAL COMPLEXITY, 2006, 15 (03) : 252 - 262
  • [6] Polynomial multiplication over finite fields: from quadratic to straight-line complexity
    Nader H. Bshouty
    Michael Kaminski
    computational complexity, 2006, 15 : 252 - 262
  • [7] Polynomial multiplication over binary finite fields: new upper bounds
    De Piccoli, Alessandro
    Visconti, Andrea
    Rizzo, Ottavio Giulio
    JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2020, 10 (03) : 197 - 210
  • [8] Polynomial multiplication over binary finite fields: new upper bounds
    Alessandro De Piccoli
    Andrea Visconti
    Ottavio Giulio Rizzo
    Journal of Cryptographic Engineering, 2020, 10 : 197 - 210
  • [9] Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
    Akleylek, Sedat
    Cenk, Murat
    Ozbudak, Ferruh
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2010, 2010, 6498 : 227 - 237
  • [10] Polynomial Multiplication over Finite Fields using Field Extensions and Interpolation
    Cenk, Murat
    Koc, Cetin Kaya
    Ozbudak, Ferruh
    ARITH: 2009 19TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARITHMETIC, 2009, : 84 - +
12345