Research Paper | Electronics & Communication Engineering | India | Volume 4 Issue 8, August 2015
An Enhanced Residue Modular Multiplier for Cryptography
Abstract: This paper presents an implementation of VLSI architecture for Dual Field Residue Arithmetic modular multiplier with less delay based on finite field arithmetic to support all public key cryptographic applications. A new method for incorporating Residue Number System (RNS) and Polynomial Residue Number system (PRNS) in modular multiplication is derived and then implemented VLSI Architecture for dual field residue arithmetic modular multiplier with less delay. This architecture supports the conversions, modular multiplication for polynomials and integers and modular exponentiation in same hardware. This architecture has a carry save adders (CSAs) and parallel prefix adders in MAC units to speed up the large integer arithmetic operations over GF (P) and GF (2^n), hence this reduces the delay up to 10 percent.
Keywords: Finite field arithmetic, Residue number and Polynomial Residue number systems, modular arithmetic, parallel arithmetic and logic structures, and montgomery multiplication
Edition: Volume 4 Issue 8, August 2015,
Pages: 2029 - 2034
Similar Articles with Keyword 'Finite'
An FPGA-Based Implementation of Emotion Recognition Using EEG Signals
Sonia Stanley Louis | Dr. Mahantesh K.
Realization of Programmable PRPG with Enhanced Fault Coverage Gradient
Lakshmi Asokan | Jeena Maria Cherian