Bit-Serial AOP Arithmetic Architectures over GF (2m)

Authors:
Hyun-Sung Kim;Kee-Young Yoo
Affiliations:
-;-
Venue:
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Year:
2002

Citing 5
Cited 0

Finite field for scientists and engineers

Finite field for scientists and engineers
Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials

IEEE Transactions on Computers
Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A public key cryptosystem and a signature scheme based on discrete logarithms

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents bit-serial arithmetic architectures for GF(2m) based on an irreducible all one polynomial. First, modular multiplier and squarer are designed. Then, two arithmetic architectures are proposed based on the modular multiplier and squarer. Proposed architectures hybrid the advantages of hardware and time complexity from previous architectures. They can be used as kernel architecture for modular exponentiations, which is very important operation in the most of public key cryptosystem. Since the multipliers have low hardware requirements and regular structures, they are suitable for VLSI implementation.