Modular multiplication method

被引:5
|
作者
Oh, JH [1 ]
Moon, SJ [1 ]
机构
[1] Kyungpook Natl Univ, Sch Elect & Elect Engn, Taegu 702701, South Korea
来源
关键词
Cryptography; Digital signature; Modular multiplication; Montgomery algorithm;
D O I
10.1049/ip-cdt:19982095
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Montgomery algorithm has been widely used in modern cryptography because it is effective for modular exponentiation. However, it is not efficient when used for just a few modular multiplications. Inefficiency is due to the large overhead involved in the residue transformation of arguments. A new modular multiplication method using the Montgomery reduction algorithm is presented which can eliminate the demerit of the Montgomery algorithm in the case of just a few modular multiplications.
引用
收藏
页码:317 / 318
页数:2
相关论文
共 50 条
  • [31] New modular multiplication algorithms for fast modular exponentiation
    Hong, SM
    Oh, SY
    Yoon, H
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '96, 1996, 1070 : 166 - 177
  • [32] A fast modular multiplication method based on the Lempel-Ziv binary tree
    Chen, CY
    Liu, TC
    COMPUTER COMMUNICATIONS, 1999, 22 (09) : 871 - 874
  • [33] Test of Verification of Multidigit Numbers on Simplicity on the Basis of Method of Vector and Modular Multiplication
    Nikolaichuk, Yaroslav
    Ivasiev, Stepan
    Yakymenko, Thor
    Kasianchuk, Mykhajlo
    2016 13TH INTERNATIONAL CONFERENCE ON MODERN PROBLEMS OF RADIO ENGINEERING, TELECOMMUNICATIONS AND COMPUTER SCIENCE (TCSET), 2016, : 534 - 536
  • [34] New systolic modular multiplication architecture for efficient Montgomery multiplication
    Choi, Se-Hyu
    Lee, Keon-Jik
    IEICE ELECTRONICS EXPRESS, 2015, 12 (02):
  • [35] Elgamal cryptoalgorithm on the basis of the vector-module method of modular exponentiation and multiplication
    Yakymenko, Ihor
    Kasianchuk, Mykhailo
    Gomotiuk, Oksana
    Tereshchuk, Grygorii
    Ivasiev, Stepan
    Basistyi, Pavlo
    15TH INTERNATIONAL CONFERENCE ON ADVANCED TRENDS IN RADIOELECTRONICS, TELECOMMUNICATIONS AND COMPUTER ENGINEERING (TCSET - 2020), 2020, : 926 - 929
  • [36] A modified radix-2 Montgomery modular multiplication with new recoding method
    Manochehri, Kooroush
    Sadeghian, Babak
    Pourmozafari, Saadat
    IEICE ELECTRONICS EXPRESS, 2010, 7 (08): : 513 - 519
  • [37] FASTER MODULAR MULTIPLICATION BY OPERAND SCALING
    WALTER, CD
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 576 : 313 - 323
  • [38] A systolic linear array for modular multiplication
    Gai, WX
    Chen, HY
    1996 2ND INTERNATIONAL CONFERENCE ON ASIC, PROCEEDINGS, 1996, : 171 - 174
  • [39] Selected RNS Bases for Modular Multiplication
    Bajard, J. C.
    Kaihara, M.
    Plantard, T.
    ARITH: 2009 19TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARITHMETIC, 2009, : 25 - +
  • [40] Modular multiplication of large integers on FPGA
    Beguenane, Rachid
    Beuchat, Jean-Luc
    Muller, Jean-Michel
    Simard, Stephane
    2005 39th Asilomar Conference on Signals, Systems and Computers, Vols 1 and 2, 2005, : 1361 - 1365