Selected RNS Bases for Modular Multiplication

被引：27
|
作者：
Bajard, J. C. [1 ]
Kaihara, M. [2 ]
Plantard, T. [3 ]
机构：
[1] Univ Montpellier 2, LIRMM, CNRS, F-34095 Montpellier 5, France
[2] Ecole Polytech Fed Lausanne, Lausanne, Switzerland
[3] Univ Wollongong, Wollongong, NSW, Australia
来源：
ARITH: 2009 19TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARITHMETIC | 2009年
关键词：
CONVERTER; RESIDUE;
D O I：
10.1109/ARITH.2009.20
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The selection of the elements of the bases in an RNS modular multiplication method is crucial and has a great impact in the overall performance. This work proposes specific sets of optimal RNS moduli with elements of Hamming weight three whose inverses used in the MRS reconstruction have very small Hamming weight. This property is exploited in RNS bases conversions, to completely remove and replace the products by few additions/subtractions and shifts, reducing the time complexity of modular multiplication. These bases are specially crafted to computation with operands of sizes 256 or more and are suitable for cryptographic applications such as the ECC protocols.
引用
收藏
页码：25 / +
页数：2
相关论文
共 50 条
  • [1] On the design of RNS bases for modular multiplication
    Esmaeildoust, Mohammad
    Rezaei, Shirin
    Gerami, Marzieh
    Navi, Keivan
    International Journal of Network Security, 2014, 16 (02) : 118 - 128
  • [2] High dynamic range RNS bases for modular multiplication
    Rezaie, Shirin
    Esmaeildoust, Mohammad
    Gerami, Marzieh
    Navi, Keivan
    Hashemipour, Omid
    International Journal of Computer Science Issues, 2011, 8 (4 4-1): : 69 - 76
  • [3] An RNS Modular Multiplication Algorithm
    Schinianakis, Dimitris
    Stouraitis, Thanos
    2013 IEEE 20TH INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS, AND SYSTEMS (ICECS), 2013, : 958 - 961
  • [4] An RNS Barrett Modular Multiplication Architecture
    Schinianakis, Dimitrios
    Stouraitis, Thanos
    2014 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2014, : 2229 - 2232
  • [5] An RNS montgomery modular multiplication algorithm
    Bajard, JC
    Didier, LS
    Kornerup, P
    13TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1997, : 234 - 239
  • [6] An iterative modular multiplication algorithm in RNS
    Yang, JH
    Chang, CC
    Wang, CH
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 171 (01) : 637 - 645
  • [7] An RNS Montgomery modular multiplication algorithm
    Bajard, JC
    Didier, LS
    Kornerup, P
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (07) : 766 - 776
  • [8] Efficient Implementation of RNS Montgomery Multiplication Using Balanced RNS Bases
    Sharifi, Sakineh
    Esmaeildoust, Mohammad
    Taheri, Mohammad Reza
    Navi, Keivan
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2014, 12 (01): : 51 - 64
  • [9] Some improvement on RNS montgomery modular multiplication
    Bajard, JC
    Didier, LS
    Kornerup, P
    Rico, F
    ADVANCED SIGNAL PROCESSING ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS X, 2000, 4116 : 214 - 225
  • [10] Fault Detection in RNS Montgomery Modular Multiplication
    Bajard, Jean-Claude
    Eynard, Julien
    Gandino, Filippo
    2013 21ST IEEE SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2013, : 119 - 126
12345