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 条
  • [41] A FAST MODULAR MULTIPLICATION ALGORITHM
    CHIOU, CW
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 49 (1-2) : 11 - 17
  • [42] STILL FASTER MODULAR MULTIPLICATION
    WALTER, CD
    ELECTRONICS LETTERS, 1995, 31 (04) : 263 - 264
  • [43] Quantifying the Overheads of Modular Multiplication
    Soni, Deepraj
    Nabeel, Mohammed
    Neda, Negar
    Karri, Ramesh
    Maniatakos, Michail
    Reagen, Brandon
    2023 IEEE/ACM INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN, ISLPED, 2023,
  • [44] Fast modular multiplication method
    Chung Cheng Inst of Technology, Taoyuan, Taiwan
    Comput Syst Sci Eng, 6 (353-358):
  • [45] A fast modular multiplication method
    Lou, DC
    Chang, CC
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1998, 13 (06): : 353 - 358
  • [46] Radix modular multiplication algorithm
    Mekhallalati, MC
    Ashur, AS
    Ibrahim, MK
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 1996, 6 (05) : 547 - 567
  • [47] LOGARITHMIC SPEED MODULAR MULTIPLICATION
    WALTER, CD
    ELECTRONICS LETTERS, 1994, 30 (17) : 1397 - 1398
  • [48] A FASTER MODULAR MULTIPLICATION ALGORITHM
    ELDRIDGE, SE
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 40 (1-2) : 63 - 68
  • [49] Still faster modular multiplication
    UMIST, Manchester, United Kingdom
    Electron Lett, 4 (263-264):
  • [50] Bipartite modular multiplication method
    Kaihara, Marcelo E.
    Takagi, Naofumi
    IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (02) : 157 - 164