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 条

[31] Design and Implementation of a Novel Bit-Parallel Systolic Multiplier Over GF(2m) for Irreducible Pentanomials
Mathe, Sudha Ellison
Boppana, Lakshmi
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2018, 27 (14)
[32] Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
Lee, CY
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (01): : 39 - 42
[33] Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
Reyhani-Masoleh, A
Hasan, MA
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (08) : 945 - 959
[34] Bit-parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations
Mathe, Sudha Ellison
Boppanal, Lakshmi
IET CIRCUITS DEVICES & SYSTEMS, 2018, 12 (04) : 315 - 325
[35] Reconfigurable implementation of bit-parallel multipliers over GF(2m) for two classes of finite fields
Imaña, JL
2004 IEEE INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, PROCEEDINGS, 2004, : 287 - 290
[36] A fast kernel for unifying GF(p) and GF(2m) montgomery multiplications in a scalable pipelined architecture
Satzoda, Ravi Kumar
Chang, Chip-Hong
2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 3378 - +
[37] A Hardware Pipelined Architecture of a Scalable Montgomery Modular Multiplier over GF(2m)
Reymond, Guillaume
Murillo, Victor
2013 INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGAS (RECONFIG), 2013,
[38] Fast modular reduction and squaring in GF(2m)
Boppre Niehues, L.
Custodio, R.
Panario, D.
INFORMATION PROCESSING LETTERS, 2018, 132 : 33 - 38
[39] The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2m)
Lee, CY
Lu, EH
Sun, LF
2000 5TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I-III, 2000, : 598 - 605
[40] High-speed bit-parallel systolic multipliers for a class of GF(2m)
Lee, CY
Lu, EH
Jau-Yien
2001 INTERNATIONAL SYMPOSIUM ON VLSI TECHNOLOGY, SYSTEMS, AND APPLICATIONS, PROCEEDINGS OF TECHNICAL PAPERS, 2001, : 291 - 294

← 1 2 3 4 5 →