PERFORMANCE ANALYSIS OF MULTIPLICATION AND INVERSION ALGORITHMS OVER GF(2M ) FOR CODING AND CRYPTOGRAPHIC APPLICATION
Ms. Jyoti N. Dindalkoppa
, Mrs. R. H. Korti
P.G. Student, Department of ECE, SDM College of Engineering and Technology , Dharwad, India
P.G. Student, Department of ECE, SDM College of Engineering and Technology , Dharwad, India
Vol. 3, Issue 4 pp. 504-512 🌐 Open Access
ABSTRACT
Finite field arithmetic logic is central in the implementation Of Reed-Solomon codes and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. This paper presents a novel sequential Type-I optimal normal basis multiplier in GF(2m ) with a regular structure. The proposed multiplier is highly regular, modular, expandable and well-suited to VLSI implementation. A new normal basis inverter based on the proposed multiplier is also presented. The proposed inverter provides better time-area complexity than existing inverters as with large m.
Keywords:
Cryptography, Finite Field, Multiplication, Normal Basis, Multiplicative Inverse, VLSI
