Fast Modular Multiplication using Parallel Prefix Adder IJTSRD


Public key cryptography applications involve use of large integer arithmetic operations which are compute intensive in term of power, delay and area. Modular multiplication, which is frequently, used most resource hungry block. Generally, last stage of modular multiplication is implemented by using carry propagate adder whose long carry chain takes more time. In this paper, modulo multiplication architectures using Carry Save and Kogge-Stone parallel prefix adder are presented to reduce this problem. Proposed implementations are faster as compared to conventional carry save adder and carry propagate adder implementations.

Sanduri Akshitha | Mrs. P. Navitha | Mrs. D. Mamatha”Fast Modular Multiplication using Parallel Prefix Adder”

Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018,

URL: http://www.ijtsrd.com/papers/ijtsrd18170.pdf

http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/18170/fast-modular-multiplication-using-parallel-prefix-adder/sanduri-akshitha

call for paper Mechanical Engineering, international journal Structural Engineering, ugc approved journals for engineering




Fast Modular Multiplication using Parallel Prefix Adder IJTSRD IEEE PAPER





2020 technology trends
2019-TOP-TECHNOLOGIES
2019 papers
2018-TOP-TECHNOLOGIES
2018 papers

IEEE PROJECTS 2019


IEEE PROJECTS CSE 2019
IEEE PROJECTS ECE 2019
IEEE PROJECTS EEE 2019
IEEE PROJECTS VLSI
IEEE PROJECTS EMBEDDED SYSTEM

IEEE PROJECTS


IEEE PROJECTS ECE
IEEE PROJECTS CSE COMPUTER SCIENCE
IEEE PROJECTS ELECTRICAL ENGINEERING
IEEE PROJECTS EEE

IEEE PROJECTS