.png){kind=icon}
.png){kind=icon}
Return
Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1076.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Based on a recently proposed Toeplitz matrix- vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases.
Keywords:
finite field
subquadratic computational complexity multiplication
normal basis
optimal normal basis
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available