Implementation of Multifunction Residue Architectures on FPGA for Cryptography Applications: A Recent Study

Modern computing relies heavily on data confidentiality and encryption. Due to its high restricted size and consequently equivalent reliability to other standard public-key algorithms, elliptical curve cryptography (ECC) is the ultimate cryptographic approach. Furthermore, to fulfil the growing demand for speed in modern implementations, cryptographic algorithms must be accelerated on hardware. The residue number method’s basic components are forward converters, modulo decimal units, and reverse converters. The reverse converter in the current network of residue numbers is based on standard and compact adders. It consumes a lot of energy and runs at a slow speed. It introduced a residue Montgomery approach for multiplying data paths among converters and between the two residue representations by analysing the input/output conversion to/from residue representation. In the same hardware, the dual field modulator does GF(p) and GF(2)n Montgomery multiplication, input/output conversions, mixed-radius conversions (MRC) for inputs and polynomials, as well as exponentiation and inversion.

Author(S) Details

A. Pradeep Kumar
Malla Reddy Engineering College (Autonomous) Main Campus, India.

V. Srinivas
Malla Reddy Engineering College (Autonomous) Main Campus, India.

View Book:- https://stm.bookpi.org/NPER-V3/article/view/4759

Related Posts

Leave a Reply

Your email address will not be published. Required fields are marked *