New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata

Authors:
Kyo-Min Ku;Kyeoung Ju Ha;Hyun-Sung Kim;Kee-Young Yoo
Affiliations:
-;-;-;-
Venue:
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Year:
2002

Citing 4
Cited 2

Finite field for scientists and engineers

Finite field for scientists and engineers
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
Systolic Multipliers for Finite Fields GF(2m)

IEEE Transactions on Computers

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modular exponentiation in a finite field is the basic computation involved in most public key crypto systems, such as Diffie-Hellman key exchange, ElGamal, etc. The current paper presents a new parallel architecture whereby the modular multiplication and squaring can be processed simultaneously in GF(2m) in m clock cycles using a cellular automata. Since the proposed cellular automata architecture is simple, regular, modular, cascadable, it can also be utilized efficiently for the implementation of VLSI.