Bit-Level Systolic Array for Fast Exponentiation in GF(2^m)
暂无分享,去创建一个
[1] H. T. Kung,et al. Fault-Tolerance and Two-Level Pipelining in VLSI Systolic Arrays , 1983 .
[2] Stafford E. Tavares,et al. Architectures for exponentiation in GF(2m) , 1988, IEEE J. Sel. Areas Commun..
[3] Chin-Liang Wang,et al. Systolic array implementation of multipliers for finite fields GF(2/sup m/) , 1991 .
[4] John V. McCanny,et al. Use of unidirectional data flow in bit-level systolic array chips , 1986 .
[5] A. Ghafoor,et al. Systolic architecture for finite field exponentiation , 1989 .
[6] Dorothy E. Denning,et al. Cryptography and Data Security , 1982 .
[7] Craig K. Rushforth,et al. A Cellular-Array Multiplier for GF(2m) , 1971, IEEE Transactions on Computers.
[8] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[9] Trieu-Kien Truong,et al. Systolic Multipliers for Finite Fields GF(2m) , 1984, IEEE Transactions on Computers.
[10] Stafford E. Tavares,et al. A Fast VLSI Multiplier for GF(2m) , 1986, IEEE J. Sel. Areas Commun..
[11] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[12] H. T. Kung. Why systolic architectures? , 1982, Computer.
[13] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[14] Dingyi Pei,et al. A VLSI DEsign for Computing Exponentiations in GF(2^m) and Its Application to Generate Pseudorandom Number Sequences , 1990, IEEE Trans. Computers.
[15] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .