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 条
  • [31] SYSTOLIC MODULAR MULTIPLICATION
    EVEN, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 619 - 624
  • [32] Quantum Modular Multiplication
    Cho, Seong-Min
    Kim, Aeyoung
    Choi, Dooho
    Choi, Byung-Soo
    Seo, Seung-Hyun
    IEEE ACCESS, 2020, 8 : 213244 - 213252
  • [33] Efficient Leak Resistant Modular Exponentiation in RNS
    Lesavourey, Andrea
    Negre, Christophe
    Plantard, Thomas
    2017 IEEE 24TH SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2017, : 156 - 163
  • [34] An RNS Based Modular Multiplier with Reduced Complexity
    Asif, Shahzad
    Vesterbacka, Mark
    2017 IEEE NORDIC CIRCUITS AND SYSTEMS CONFERENCE (NORCAS): NORCHIP AND INTERNATIONAL SYMPOSIUM OF SYSTEM-ON-CHIP (SOC), 2017,
  • [35] New efficient structure for a modular multiplier for RNS
    Hiasat, AA
    IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (02) : 170 - 174
  • [36] On Bases That Are Closed Under Multiplication
    Kania, Tomasz
    AMERICAN MATHEMATICAL MONTHLY, 2017, 124 (07): : 651 - 653
  • [37] RNS Montgomery multiplication algorithm for duplicate processing of base transformations
    Nozaki, H
    Shimbo, A
    Kawamura, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (01) : 89 - 97
  • [38] PERFORMANCE EVALUATION OF DIGITAL SIGNATURE USING RNS MONTGOMERY MULTIPLICATION
    Mehr, Payam Shadman
    Esmaeildoust, Mohammad
    IIOAB JOURNAL, 2016, 7 : 109 - 113
  • [39] Fast RNS Implementation of Elliptic Curve Point Multiplication on FPGAs
    Wu, Tao
    JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2024, 96 (11): : 673 - 684
  • [40] Pipelined arrays for modular multiplication
    Ciminiera, L
    ISCAS '98 - PROCEEDINGS OF THE 1998 INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-6, 1998, : C397 - C400
12345