Structure of Parallel Multipliers for a Class of Fields GF(2^m)
暂无分享,去创建一个
[1] Ronald C. Mullin,et al. Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..
[2] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[3] Stafford E. Tavares,et al. Architectures for exponentiation in GF(2m) , 1988, IEEE J. Sel. Areas Commun..
[4] Thomas Beth,et al. On the Arithmetics of Galoisfields and The Like. Algebraic Questions Arising in the Design of Secure Communication Systems , 1985, AAECC.
[5] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.
[6] Dieter Gollmann,et al. Architectures for Exponentiation in GF(2n) , 1986, CRYPTO.
[7] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .