一种可重构的快速有限域乘法结构

袁丹寿; 戎蒙恬

一种可重构的快速有限域乘法结构

计量
- 文章访问数: 2606
- HTML全文浏览量: 136
- PDF下载量: 650
- 被引次数: 0
出版历程
- 收稿日期: 2004-06-03
- 修回日期: 2004-09-09
- 刊出日期: 2006-04-19

Reconfigurable and Fast Finite Field Multiplier Architecture

摘要

摘要: 在一种改进的串行乘法器的基础上，提出了一种可重构的快速有限域GF (2m )(1＜mM)乘法器结构。利用一组配置信号和逻辑电路来改变有限域的度m，使得乘法器可以重构和编程。同时采用门控时钟减小电路功耗。该乘法器结构具有可重构性、高灵活性和低电路复杂性等特点。与传统的移位乘法器相比，它将乘法器速度提高一倍。这种乘法器适合于变有限域，低硬件复杂度的高性能加密算法的VLSI设计。
- VLSI;有限域;乘法器; 可重构; 椭圆曲线密码
Abstract: A reconfigurable and fast architecture over Galois field GF (2m )(1＜mM) is presented based on the improved serial multiplier. The value m, of the irreducible polynomial degree, can changed by adding a set of configuring signals and logic circuits, which results in that the multiplier architecture is reconfigurable and programmable without changing the hardware. The proposed multiplier architecture has high order of flexibility and low hardware complexity. Compared with the traditional serial multiplier, it can obtain twice speed-up. It suits high-security cryptographic applications with variable finite fields and low complexity requirements.

HTML全文

参考文献(1)

Menezes A J, Oorscho P C V, Vanstone S A. Handbook ofApplied Cryptography, Boca Raton, FL, CRC Press,1997.[2]Orlando G Efficient elliptic curve processor architectures forfield programmable logic [PhD thesis]. Dept.of Electrical Eng.,Worcester Polytechnic Institute, America, 2002.Bednara M, Daldrup M, Gathen J V Z. Reconfigurableimplementation of elliptic curve crypto algorithms. parallel anddistributed processing symposium. Proceedings International,IPDPS, Fort Lauderdale, Florida 2002: 157 - 164.[3]Mastrovito E. VLSI architectures for computation in Galoisfields [PhD thesis]. Dept.of Electrical Eng., Linkoping Univ.,Sweden, 1991.[4]Lee C Y, Lu E H, Sun L F. Low-complexity bit-parallel systolicarchitecture for computing AB* + C in a class of finite fieldGF(2'). IEEE Trans. on Circuits and Syslems 11, 2001, 48(5):519- 523.[5]Paar C, Fleischmann P, Rordriguez P S. Fast arithmetic forpublic-key algorithms in Galois fields GF(2) with compositeexponents. IEEE Trans. on Computers, 1999,38(7): 796 - 800.[6]Moon S, Park J, Lee Y. Fast VLSl arithmetic algorithms forhigh-security cryptographic application. IEEE Trans. onConsumer Electronics, 2001 47(3): 700 - 708.[7]Kitsos P, Theodoridis G, Koufopavlou 0 . An efticientreconfigurable multiplier architecture for GF(2')[J].Microelectronic Journal.2003,34(10):975-[8]Hasan M A, Ebtedaei M. Eficient architectures for computationsover variable dimensional Galois fields[J].IEEE Trans. onCircuitsandSystems I.1998,45(11):1205-[9]Beth T, Gollman D. Algorithm engineering for public keyalgorithms. IEEE J. on Selected Areas in Communications, 1989,7 (4): 466 - 485.

施引文献

资源附件(0)

访问统计