Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases

被引:38
作者
Fan, Haining [1 ]
Hasan, M. Anwar
机构
[1] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
finite field; subquadratic computational complexity multiplication; normal basis; optimal normal basis;
D O I
10.1109/TC.2007.1076
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1435 / 1437
页数:3
相关论文
共 16 条