Finite field for scientists and engineers
Finite field for scientists and engineers
Principles of digital design
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Bit-Level Systolic Array for Fast Exponentiation in GF(2/sup m/)
IEEE Transactions on Computers
New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Systolic Multipliers for Finite Fields GF(2m)
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper, we present a new exponentiation architecture and multiplier/ squarer which are the basic operations for exponentiation on GF(2m). The proposed multiplier/squarer is used as kernal architecture of exponentiation and processes the modular multiplication and squaring at the same time for effective exponentiation on GF(2m) using a cellular automata. Proposed architecture can be used efficiently for the design of the modular exponentiation on the finite field in most public key crypto systems such as Diffie-Hellman key exchange, ElGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.