IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Cryptography and data security
Cryptography and data security
IEEE Transactions on Computers
Architectures for Arithmetic over GF(2^m)
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)
IEEE Transactions on Computers
Computers and Electrical Engineering
Unified parallel systolic multiplier over GF(2m)
Journal of Computer Science and Technology
Time-space efficient exponentiation over GF(2m)
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Fast exponentiaion over GF(2m) based on cellular automata
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Efficient semisystolic architectures for finite-field arithmetic
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Unidirectional two dimensional systolic array for multiplication in GF(2m) using LSB first algorithm
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
| Hi-index | 14.99 |
This paper presents a new parallel-in-parallel-out bit-level systolic array with unidirectional data flow for computing exponentiation in GF(2/sup m/). The array is highly regular, modular, and thus well suited to very-large-scale-integration implementation. In addition, it can provide the maximum throughput in the sense of producing new results at a rate of one per clock cycle. As compared with a previously known systolic GF(2/sup m/) exponentiator with the same throughput performance, the proposed system requires much less chip area, has small latency, and is easier to incorporate fault-tolerant design.