PERFORMANCE ANALYSIS OF MULTIPLICATION AND INVERSION ALGORITHMS OVER GF(2M ) FOR CODING AND CRYPTOGRAPHIC APPLICATION

Authors

  • Ms. Jyoti N. Dindalkoppa P.G. Student, Department of ECE, SDM College of Engineering and Technology , Dharwad
  • Mrs. R. H. Korti Professor, Department of ECE, SDM College of Engineering and Technology , Dharwad

Keywords:

Cryptography, Finite Field, Multiplication, Normal Basis, Multiplicative Inverse, VLSI

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.

Downloads

Published

2016-04-25

How to Cite

Ms. Jyoti N. Dindalkoppa, & Mrs. R. H. Korti. (2016). PERFORMANCE ANALYSIS OF MULTIPLICATION AND INVERSION ALGORITHMS OVER GF(2M ) FOR CODING AND CRYPTOGRAPHIC APPLICATION . International Journal of Advance Research in Engineering, Science & Technology, 3(4), 504–512. Retrieved from https://ijarest.org/index.php/ijarest/article/view/583

Issue

Vol. 3 No. 4 (2016): Volume: 03, Issue: 04 - April, 2016.

Section

Articles