• Sanduri Akshitha
• Mrs. P. Navitha
• Mrs.D.Mamatha

In modular arithmetic,Montgomery modular multiplication,more commonly reffered to as Montgomery multiplication, is a method for performing fast modular multiplication (MM). Modular multiplication is basic operation in public key cryptosystems like RSA.Montgomery modular multiplication being efficient is widely used.It is based on additions and shift operations.The proposed multiplier represents the data in binary representation and uses carry-save adder (CSA) to avoid the carry propagation at each addition operation. We are proposing a Montgomery modular multiplication by using parallel prefix adders(PPA) which are a special case of carry look ahead adders. Parallel prefix adders reduce the carry propagation delay as compared to Ripple carry adders (RCA) and does not have the huge area overhead like Carry look ahead adder(CLA).

carry-save addition, Montgomery modular multiplier, public-key cryptosystem.

"AN EFFICIENT MONTGOMERY MODULAR MULTIPLIER USING PARALLEL PREFIX ADDER", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.32-40, July-2018, Available :http://www.jetir.org/papers/JETIR1807256.pdf

"AN EFFICIENT MONTGOMERY MODULAR MULTIPLIER USING PARALLEL PREFIX ADDER", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp32-40, July-2018, Available at : http://www.jetir.org/papers/JETIR1807256.pdf