Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m
暂无分享,去创建一个
[1] Stafford E. Tavares,et al. Architectures for exponentiation in GF(2m) , 1988, IEEE J. Sel. Areas Commun..
[2] R. McEliece. Finite field for scientists and engineers , 1987 .
[3] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[4] Ke Wang,et al. The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm , 1984, IEEE Transactions on Computers.
[5] Chin-Liang Wang,et al. Systolic array implementation of multipliers for finite fields GF(2/sup m/) , 1991 .
[6] R. McEliece. Finite Fields for Computer Scientists and Engineers , 1986 .
[7] Trieu-Kien Truong,et al. Systolic Multipliers for Finite Fields GF(2m) , 1984, IEEE Transactions on Computers.
[8] Keshab K. Parhi,et al. Efficient semisystolic architectures for finite-field arithmetic , 1998, IEEE Trans. Very Large Scale Integr. Syst..
[9] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.