文章基本信息

标题：Selected RNS Bases for Efficient Design of Montgomery Multiplication
本地全文：下载
作者：Elham Javadnoori ; Saeed Setayeshi ; Mohammad Kheirandish 等
期刊名称：International Journal of Computer Science and Network Solutions
印刷版ISSN：2345-3397
出版年度：2014
卷号：2
期号：9
页码：10-19
出版社：International Journal of Computer Science and Network Solutions
摘要：During the last years, different fast hardware implementations of RSA encryption have been done. InRSA algorithm the base operation is modular exponentiation. An efficient approach for modularexponentiation is Montgomery multiplication which computes the remainders without any division.Residue number system (RNS), replace large numbers with their small residues and does themathematical operations on its small residues in parallel and without carry propagation. RNSMontgomery multiplication, similar to Montgomery multiplication has no division and moreover itcomputes addition, subtraction, and multiplication in RNS and therefore it is more efficient. Moduliselection has a great impact on RNS efficiency. In previous works optimal moduli sets are reported andin this work we propose a moduli set that is more efficient than the previous works.
关键词：RSA; Montgomery Multiplication; RNS; Moduli Set