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 |
The modular exponentiation on the finite field is the basic operation in most public key crypto systems. In this paper, we propose a multiplier/squarer which simultaneously processes the modular multiplication and squaring over GF(2m) based on cellular automata. For effective exponentiation on GF(2m), we use a proposed multiplier/squarer. Since the cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.