Modular multiplication using the core function in the residue number system

被引:15
作者
Kong, Yinan [1 ]
Asif, Shahzad [1 ]
Khan, Mohammad A. U. [2 ]
机构
[1] Macquarie Univ, Dept Engn, N Ryde, NSW 2109, Australia
[2] Effat Univ, Dept Elect & Comp Engn, Jeddah, Saudi Arabia
关键词
Digital arithmetic; Modular multiplication; The residue number system; Core function; PARALLEL; ARRAY; CMOS;
D O I
10.1007/s00200-015-0268-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Modular multiplication can be performed in the residue number system (RNS) using a type of Montgomery reduction. This paper presents an alternative in which RNS modular multiplication are performed by using the core function. All of the intermediate calculations use short wordlength operations within the RNS. This work contributes to the long wordlength modular multiplication operation , the basis of many DSPs and public-key cryptosystems.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 38 条
[1]  
Akushskii J., 1977, CODING THEORY OPTIMI
[2]   Modular multiplication and base extensions in residue number systems [J].
Bajard, JC ;
Didier, LS ;
Kornerup, P .
ARITH-15 2001: 15TH SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2001, :59-65
[3]  
Barraclough S.R, 1989, P IEEE CICC SAN DIEG
[4]   2 COMPLEMENT PARALLEL ARRAY MULTIPLICATION ALGORITHM [J].
BAUGH, CR .
IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (12) :1045-1047
[5]   Scaled and unsealed residue number system to binary conversion techniques using the core function [J].
Burgess, N .
13TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1997, :250-257
[6]  
Burgess N, 2003, P 16 IEEE S COMP AR
[7]  
Chokshi Rooju, P 2009 INT C COMPILE, P19, DOI [10.1145/1629395.1629401, DOI 10.1145/1629395.1629401]
[8]  
Dadda L., 1965, Alta Freq, V34, P349
[9]  
Dhanesha H., 1995, Proceedings. Sixteenth Conference on Advanced Research in VLSI, P150, DOI 10.1109/ARVLSI.1995.515617
[10]  
Elleithy K., 1991, 25 AS C 1991 AS C SI, V1., P408, DOI [10.1109/ ACSSC. 1991.186482, DOI 10.1109/ACSSC.1991.186482]