On calculating multiplicative inverses modulo 2m

被引：8
|
作者：
Arazi, Ortal [1 ]
Qi, Hairong [1 ]
机构：
[1] Univ Tennessee, Dept Elect & Engn & Comp Sci, Knoxville, TN 37996 USA
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2008年 / 57卷 / 10期
关键词：
modular arithmetic; modular multiplication; modular multiplicative inverse;
D O I：
10.1109/TC.2008.54
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents a procedure for calculating multiplicative inverses modulo 2(m), based on a novel mathematical approach. The procedure is suitable for software implementation on a general-purpose processor. When counting the total number of word-level processor multiplications, the computational effort involved in calculating a multiplicative inverse is 2/3 that of a single multiplication of m-bit values, in addition to a few word-level multiplications. For standard processor word sizes, the number of these additional multiplications does not exceed 12. This introduces a clear advantage of the proposed method when compared to other known methods presented in the literature.
引用
收藏
页码：1435 / 1438
页数：4
相关论文
共 50 条
  • [21] An efficient algorithm for computing inverses in GF(2m) using dual bases
    Yoo, HS
    Yoon, SU
    Kim, ES
    COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS, 2003, 2660 : 994 - 999
  • [22] VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2(m))
    Wei, SW
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1997, 44 (10): : 847 - 855
  • [23] O(log2m) iterative algorithm for multiplicative inversion in GF(2m)
    Morioka, S
    Katayama, Y
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 449 - 449
  • [24] Double-basis multiplicative inversion over GF(2m)
    Hasan, MA
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (09) : 960 - 970
  • [25] On the multiplicative properties modulo m of numbers with missing digits
    N. G. Moshchevitin
    I. D. Shkredov
    Mathematical Notes, 2007, 81 : 338 - 355
  • [26] On the multiplicative properties modulo m of numbers with missing digits
    Moshchevitin, N. G.
    Shkredov, I. D.
    MATHEMATICAL NOTES, 2007, 81 (3-4) : 338 - 355
  • [27] Lehmer-based algorithm for computing inverses in Galois fields GF(2m)
    Argüello, F
    ELECTRONICS LETTERS, 2006, 42 (05) : 270 - 271
  • [28] On matrix inverses modulo a subspace
    Carriegos, MV
    Garda-Planas, MI
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 379 : 229 - 237
  • [29] Some constacyclic self-dual codes over the integers modulo 2m
    Kai, Xiaoshan
    Zhu, Shixin
    Tang, Yongsheng
    FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (02) : 258 - 270
  • [30] A fast algorithm for multiplicative inversion in GF(2m) using normal basis
    Takagi, N
    Yoshiki, J
    Takagi, K
    IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (05) : 394 - 398
12345