Group Properties of Cellular Automata and VLSI Applications
IEEE Transactions on Computers
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Systolic Power-Sum Circuit for GF(2/sup m/)
IEEE Transactions on Computers
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Systolic Multipliers for Finite Fields GF(2m)
IEEE Transactions on Computers
Efficient semisystolic architectures for finite-field arithmetic
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
This paper proposes a new parallel algorithm and architecture for two modular multiplications over GF(2m). The algorithm uses the property of irreducible all one polynomial as a modulus and computes two modular multiplications in parallel. The architecture is based on cellular automata and has smaller area and time complexity than previous architectures. Since the proposed architecture has regularity, modularity and concurrency, it is suitable for VLSI implementation. The proposed architecture can be used as a basic architecture for the public-key cryptosystems.