Efficiency Unleashed Montgomery Modular Multiplier

This, in fact is the knowledge generation hypothesis, where the imposition of knowledge barrier will be broken upon the launching of a novel high throughput barrier resilient Montgomery multiplier, which takes full advantage of optimal Barrett reduction which is actually in quest of further improvement of modular multiplication for applications on cryptographic systems as well as digital signal processors. Because Montgomery multiplication is intrinsically parallel and the reduction is included within it, such an architecture provides high throughput with very low latency. While such sophisticated design is being embedded within the optimization of the hardware implementations, such optimization will be based on a practical orientation aimed at maximizing parallel processing, pipelining, and resource sharing, while minimizing the critical path delay. In addition to that, it takes care of the smart problem of the input and output data formats for ease in its integration into the existing system and protocols. However, the simulation and synthesis measure and quantify the performance, area, and power consumption extension of this work in comparison with the classical methods of design. This work, in the end, would allow accelerating important cryptographic operations within any kind of resource-centric environment, providing improvements toward efficiency and better security in many cryptographic techniques and their real-world applications.

Authors

Publication Details

Published
2024-12-11
DOI
https://doi.org/10.1109/icscna63714.2024.10863931
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficiency Unleashed Montgomery Modular Multiplier

S. Vijayalakshmi, K R Kavitha, B. Murali Babu, B K Kirthivasan et al.
1 citations
Coding theory and cryptography
0.35
article

Efficiency Unleashed Montgomery Modular Multiplier

S. Vijayalakshmi, K R Kavitha, B. Murali Babu, B K Kirthivasan, R Negaasri
article en
1 citations

Abstract

This, in fact is the knowledge generation hypothesis, where the imposition of knowledge barrier will be broken upon the launching of a novel high throughput barrier resilient Montgomery multiplier, which takes full advantage of optimal Barrett reduction which is actually in quest of further improvement of modular multiplication for applications on cryptographic systems as well as digital signal processors. Because Montgomery multiplication is intrinsically parallel and the reduction is included within it, such an architecture provides high throughput with very low latency. While such sophisticated design is being embedded within the optimization of the hardware implementations, such optimization will be based on a practical orientation aimed at maximizing parallel processing, pipelining, and resource sharing, while minimizing the critical path delay. In addition to that, it takes care of the smart problem of the input and output data formats for ease in its integration into the existing system and protocols. However, the simulation and synthesis measure and quantify the performance, area, and power consumption extension of this work in comparison with the classical methods of design. This work, in the end, would allow accelerating important cryptographic operations within any kind of resource-centric environment, providing improvements toward efficiency and better security in many cryptographic techniques and their real-world applications.

Affordable and clean energy
Openalex Percentile: Top 29%
Coding theory and cryptography
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.