Home / Current Issue / Paper 1700131
Design And Implementation Of Low-Complexity Redundant Multiplier Architecture For Finite Field
Subject area: Science,Engineering and Technology · Area of research: VLSI( ELECTRONICS AND COMMUNICATION ENGINEERING)
Abstract
In the present work, a low-complexity Digit-Serial/parallel Multiplier over Finite Field is proposed. It is employed in applications like cryptography for data encryption and decryption to deal with discrete mathematical and arithmetic structures. The proposed multiplier utilizes a redundant representation because of their free squaring and modular reduction. The proposed 10-bit multiplier is simulated and synthesized using Xilinx Verilog HDL. It is evident from the simulation results that the multiplier has significantly low area and power when compared to the previous structures using the same representation.
Keywords
Digit-Serial, Finite Field multiplication, Redundant Basis
How to cite this paper
@article{1700131,
author = {VEERRAJU KAKI},
title = {Design And Implementation Of Low-Complexity Redundant Multiplier Architecture For Finite Field},
journal = {Iconic Research And Engineering Journals},
year = {2017},
volume = {1},
number = {6},
pages = {76-80},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1700131.pdf},
abstract = {In the present work, a low-complexity Digit-Serial/parallel Multiplier over Finite Field is proposed. It is employed in applications like cryptography for data encryption and decryption to deal with discrete mathematical and arithmetic structures. The proposed multiplier utilizes a redundant representation because of their free squaring and modular reduction. The proposed 10-bit multiplier is simulated and synthesized using Xilinx Verilog HDL. It is evident from the simulation results that the multiplier has significantly low area and power when compared to the previous structures using the same representation.},
keywords = {Digit-Serial, Finite Field multiplication, Redundant Basis},
month = {December},
}