Abstract

In this paper, we present a novel systolic VLSI architecture for performing fast modular multiplication in RSA cryptosystem. First, we propose a modified version of Montgomery's modular multiplication algorithm using a precomputed addition result, and then the proposed algorithm is mapped onto linear systolic arrays of processing elements for modular multiplication. Our implementation results have shown that the proposed systolic VLSI architecture is suitable for implementing high performance RSA cryptosystem, compared to conventional Montgomery's algorithm.

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