Modular multiplication method

被引：5
|
作者：
Oh, JH [1 ]
Moon, SJ [1 ]
机构：
[1] Kyungpook Natl Univ, Sch Elect & Elect Engn, Taegu 702701, South Korea
来源：
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | 1998年 / 145卷 / 04期
关键词：
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 条
  • [1] Fast modular multiplication method
    Chung Cheng Inst of Technology, Taoyuan, Taiwan
    Comput Syst Sci Eng, 6 (353-358):
  • [2] A fast modular multiplication method
    Lou, DC
    Chang, CC
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1998, 13 (06): : 353 - 358
  • [3] Bipartite modular multiplication method
    Kaihara, Marcelo E.
    Takagi, Naofumi
    IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (02) : 157 - 164
  • [4] A Novel Method of Modular Multiplication Based on Karatsuba-like Multiplication
    Gu, Zhen
    Li, Shuguo
    2020 IEEE 27TH SYMPOSIUM ON COMPUTER ARITHMETIC (ARITH), 2020, : 33 - 40
  • [5] A Collision Detection Method Based Similarity Detection of Modular Multiplication on Scalar Multiplication
    Han, Xu-Cang
    Cao, Wei-Qiong
    Chen, Hua
    Li, Hao-Yuan
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2024, 52 (11): : 3865 - 3876
  • [6] A new modular multiplication method in public key cryptosystem
    Rama Chandra Rao, G.A.V.
    Lakshmi, P.V.
    Ravi Shankar, N.
    International Journal of Network Security, 2013, 15 (01) : 23 - 27
  • [7] New frameworks for Montgomery's modular multiplication method
    McLaughlin, PB
    MATHEMATICS OF COMPUTATION, 2004, 73 (246) : 899 - 906
  • [8] MONTGOMERY MODULAR-MULTIPLICATION METHOD AND SYSTOLIC ARRAYS SUITABLE FOR MODULAR EXPONENTIATION
    IWAMURA, K
    MATSUMOTO, T
    IMAI, H
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1994, 77 (03): : 40 - 51
  • [9] The alternative Method to Finish Modular Exponentiation and Point Multiplication Processes
    Somsuk, Kritsanapong
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2021, 15 (07): : 2610 - 2630
  • [10] Unified method for iterative computation of modular multiplication and reduction operations
    Freking, William L.
    Parhi, Keshab K.
    Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1999, : 80 - 87
12345