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
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
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. IJAREST, 3(4), 504-512.
BibTeX
@article{ijarest2016F2CF37,
title={{PERFORMANCE ANALYSIS OF MULTIPLICATION AND INVERSION ALGORITHMS OVER GF(2M ) FOR CODING AND CRYPTOGRAPHIC APPLICATION}},
author={Ms. Jyoti N. Dindalkoppa and Mrs. R. H. Korti},
journal={IJAREST},
volume={3},
number={4},
pages={504-512},
year={2016}
}Published under an open-access licence. See copyright & licensing.