Abstract

RSA public key cryptosystem provides encryption and digital signatures. With growth of key size an efficient design of RSA in terms of area, frequency, throughput and power consumption is hard to achieve. Also with the different type of attacks possible, a need for secure RSA cryptosystem which is attack resistant has arisen. This study presents RSA design with Montgomery powering ladder and proposed carry save common multiplicand Montgomery on FPGAs. Since the modular exponentiation is based on Montgomery powering ladder therefore it is power attack resistant. Common multiplicand Montgomery modular multiplication reduces the complexity by computing once the common operations in modular squaring and modular multiplication. The proposed carry save common multiplicand Montgomery modular multiplication maintains intermediate results in carry save form and utilizes the DSP slices to convert the redundant results into binary at the end of the modular multiplication. The proposed RSA design implemented on FPGAs is efficient in terms of area, frequency, power consumption and is power attack resistant.

Highlights

  • Systolic arrays and carry save designs (McIvor et al, 2004; Fournaris, 2010) for Montgomery modularRSA is a popular public key cryptosystem multiplication (Montgomery, 1985) are in literature

  • This study presents RSA design with Montgomery powering ladder and proposed carry save common multiplicand Montgomery on FPGAs

  • The work in this study aims in Common multiplicand multiplication takes the advantage power attack resistant efficient RSA design with low of parallel modular squaring and multiplication and power consumption so that it is energy efficient design

Read more

Summary

Introduction

Systolic arrays and carry save designs (McIvor et al, 2004; Fournaris, 2010) for Montgomery modularRSA is a popular public key cryptosystem multiplication (Montgomery, 1985) are in literature. Montgomery powering ladder (Fournaris, 2010) It employs carry save logic in all its has a regular structure with parallel modular squaring and inputs, outputs, intermediate values and computations. It modular multiplication and prevents the implementation is optimized in terms of area, frequency and throughput attacks due to its regular behavior (Joye and Yen, 2002). The work in this study aims in Common multiplicand multiplication takes the advantage power attack resistant efficient RSA design with low of parallel modular squaring and multiplication and power consumption so that it is energy efficient design

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call