A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
暂无分享,去创建一个
Anh Dinh | R. J. Palmer | R. J. Bolton | Ralph Mason | R. Bolton | A. Dinh | R. Mason | R. Palmer
[1] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.
[2] Shyue-Win Wei,et al. VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/) , 1997 .
[3] Keshab K. Parhi,et al. Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/) , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).
[4] Keshab K. Parhi,et al. Efficient semisystolic architectures for finite-field arithmetic , 1998, IEEE Trans. Very Large Scale Integr. Syst..
[5] M. Anwar Hasan. Double-Basis Multiplicative Inversion Over GF(2m) , 1998, IEEE Trans. Computers.
[6] Chin-Liang Wang,et al. Systolic Array Implementation o Euclid's Algorithm for Inversion and Division in GF(2m) , 1998, IEEE Trans. Computers.
[7] Christof Paar,et al. Efficient Multiplier Architectures for Galois Fields GF(2 4n) , 1998, IEEE Trans. Computers.
[8] Shyue-Win Wei. VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/) , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.
[9] Yong-Jin Jeong,et al. VLSI array synthesis for polynomial GCD computation and application to finite field division , 1994 .