作者
Apostolos P Fournaris, O Koufopavlou
发表日期
2005/5/23
研讨会论文
2005 IEEE International Symposium on Circuits and Systems
页码范围
4645-4648
出版商
IEEE
简介
RSA is a widely acceptable and well used algorithm in many security applications. Its main mathematical function is the demanding, in terms of speed, operation of modular exponentiation. In this paper a systolic, scalable, redundant carry-save modular multiplier and an RSA encryption architecture are proposed using the Montgomery modular multiplication algorithm. By completely avoiding the transformations from redundant to non-redundant numbers at the intermediate stages of the architectures, the need for addition is eliminated and very interesting results, in terms of clock frequency, throughput and chip covered area, are achieved.
学术搜索中的文章
AP Fournaris, O Koufopavlou - 2005 IEEE International Symposium on Circuits and …, 2005