[1] MASOLEH A R.Efficient Algorithms and Architcctures for Field Multiplication Using Gaussian Normal Bases[J].IEEE Transactions on Computers,2006,55(1):34-47.[2] KOC C K,SUNAR B.Low-Complexity Bit-Parallel Canonical Normal Basis Multipliers for a Class of Finite Fields[J].IEEE Transactions on Computers,1998,47(3):353-356.[3] SUNAR B,KOC C K.An Efficient Optimal Normal Basis Type Ⅱ Multiplier[J].IEEE Transactions on Computers,2001,50(5):83-87.[4] 王庆先,孙世新,方冰.基于Ⅱ型最优正规基的串行乘法器[J].系统工程与电子技术,2005,27(8):65-69.[5] 曾晓洋,魏仲慧,郝志航.弱对偶基下比特并行RS编码器的设计[J].光电工程,2001,28(3):1 494-1 496. [6] QUTTINEH N H.Computational Complexity of Finite Field Multiplication[M].Examensarbete UtfÁorti Datatransmission vid LinkÁopings Tekniska HÁogskola,Linkoping,2003. [7] RUDIN W.数学分析原理[M].英文版.北京:机械工业出版社,2004.