Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{144799,
        author = {Baana Lakshmi Narayanamma and B.Aruna},
        title = {VLSI Implementation of High Performance Montgomery Modular Multiplication for Crypto graphical Application},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {4},
        pages = {56-64},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=144799},
        abstract = {This paper proposes a simple and efficient Montgomery multiplication algorithm such that the low-cost and high-performance Montgomery modular multiplier can be implemented accordingly. Full-adder or two serial half-adders, is proposed to reduce the extra clock cycles for operand pre computation and format conversion by half. In addition, a mechanism that can detect and skip the unnecessary carry-save addition operations in the one-level CCSA architecture while maintaining the short critical path delay is developed. As a result, the extra clock cycles for operand pre computation and format conversion can be hidden and high throughput can be obtained. Experimental results show that the proposed Montgomery modular multiplier can achieve higher performance and significant area–time product Improvement when compared with previous design.},
        keywords = {Montgomery},
        month = {},
        }