[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.
[6] QUTTINEH N H.Computational Complexity of Finite Field Multiplication[M].Examensarbete UtfÁorti Datatransmission vid LinkÁopings Tekniska HÁogskola,Linkoping,2003.