Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)

被引：0

作者：

Rashidi, Bahram ^{[1
]}

Sayedi, Sayed Masoud ^{[1
]}

Farashahi, Reza Rezaeian ^{[2
]}

机构：

[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan 8415683111, Iran

[2] Isfahan Univ Technol, Dept Math, Esfahan 8415683111, Iran

来源：

2015 12TH INTERNATIONAL IRANIAN SOCIETY OF CRYPTOLOGY CONFERENCE ON INFORMATION SECURITY AND CRYPTOLOGY (ISCISC) | 2015年

关键词：

Bit-parallel Montgomery Multiplier; Pipelining; Elliptic Curve Cryptography; Trinomials; MULTIPLIERS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents an efficient implementation of a fast and pipelined Bit-parallel Montgomery multiplier and squaring over GF(2(m)) generated by irreducible trinomials. The architecture of the multiplier is based on a parallel and independent computation of multiplication by negative powers of x as polynomial variable in multiplication and squaring. The structure has a regular and low complex architecture with a low critical path. The critical path delay is decreased by using a 2-stage pipelining technique. The proposed method over the binary extension field GF(2(233)) has been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX100 FPGA. Maximum operation frequency of multiplier is 281.3 MHz.

引用

页码：17 / 22

页数：6

共 50 条

[21] Universal VLSI architecture for bit-parallel computation in GF(2m)
Lin, CC
Chang, FK
Chang, HC
Lee, CY
PROCEEDINGS OF THE 2004 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1 AND 2: SOC DESIGN FOR UBIQUITOUS INFORMATION TECHNOLOGY, 2004, : 125 - 128
[22] Concurrent error detection in Montgomery multiplication over GF(2m)
Chiou, CW
Lee, CY
Deng, AW
Lin, JM
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (02) : 566 - 574
[23] High Speed Bit-Parallel Systolic Multiplier over GF (2m) for Cryptographic Application
Sargunam, B.
Mozhi, S. Arul
Dhanasekaran, R.
2012 IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2012, : 244 - 247
[24] Bit-parallel arithmetic implementations over finite fields GF(2m) with reconfigurable hardware
Imaña, JL
ACTA APPLICANDAE MATHEMATICAE, 2002, 73 (03) : 337 - 356
[25] Bit-Parallel Arithmetic Implementations over Finite Fields GF(2m) with Reconfigurable Hardware
José Luis Imaña
Acta Applicandae Mathematica, 2002, 73 : 337 - 356
[26] Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m)
Park, Sun-Mi
Chang, Ku-Young
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (12) : 2317 - 2321
[27] Bit-Parallel Systolic Architecture for AB and AB2 Multiplications over GF(2m)
Kim K.-W.
IEICE Transactions on Electronics, 2022, E105.C (05) : 203 - 206
[28] Efficient Combined Algorithm for Multiplication and Squaring for Fast Exponentiation over Finite Fields GF(2m)
Kim, Kee-Won
Lee, Hyun-Ho
Kim, Seung-Hoon
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON EMERGING DATABASES: TECHNOLOGIES, APPLICATIONS, AND THEORY, 2018, 461 : 50 - 57
[29] Speedup of bit-parallel Karatsuba multiplier in GF(2m) generated by trinomials
Li, Yin
Chen, Gong-liang
Li, Jian-hua
INFORMATION PROCESSING LETTERS, 2011, 111 (08) : 390 - 394
[30] A fast parallel implementation of elliptic curve point multiplication over GF(2m)
Rodríguez-Henríquez, F
Saqib, NA
Díaz-Pérez, A
MICROPROCESSORS AND MICROSYSTEMS, 2004, 28 (5-6) : 329 - 339

← 1 2 3 4 5 →