VLSI array processors
A systolic array design methodology for sequential loop algorithms
A systolic array design methodology for sequential loop algorithms
Bit-level systolic arrays for finite-field multiplications
Journal of VLSI Signal Processing Systems
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
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 |
The modular multiplication is known as an efficient basic operation for public key cryptosystems over GF(2m). Various systolic architectures for performing the modular multiplication have already been proposed based on a standard basis representation. However, they have high hardware complexity and long latency. Thereby, this paper presents a new algorithm and architecture for the modular multiplication in GF(2m). First, a new algorithm is proposed based on the LSB-first scheme using a standard basis representation. Then, bit serial systolic multiplier is derived with a low hardware complexity and small latency. Since the proposed architecture incorporates simplicity, regularity, and modularity, it is well suited to VLSI implementation and can be easily applied to modular exponentiation architecture. Furthermore, the architecture will be utilized for the basic architecture of crypto-processor.