首页 | 本学科首页   官方微博 | 高级检索  
     

一种可重构的快速有限域乘法结构
引用本文:袁丹寿, 戎蒙恬. 一种可重构的快速有限域乘法结构[J]. 电子与信息学报, 2006, 28(4): 717-720.
作者姓名:袁丹寿  戎蒙恬
作者单位:上海交通大学电子工程系,上海,200030;上海交通大学电子工程系,上海,200030
摘    要:在一种改进的串行乘法器的基础上,提出了一种可重构的快速有限域GF (2m )(1<mM)乘法器结构。利用一组配置信号和逻辑电路来改变有限域的度m,使得乘法器可以重构和编程。同时采用门控时钟减小电路功耗。该乘法器结构具有可重构性、高灵活性和低电路复杂性等特点。与传统的移位乘法器相比,它将乘法器速度提高一倍。这种乘法器适合于变有限域,低硬件复杂度的高性能加密算法的VLSI设计。

关 键 词:VLSI  有限域  乘法器   可重构   椭圆曲线密码
文章编号:1009-5896(2006)04-0717-04
收稿时间:2004-06-03
修稿时间:2004-09-09

Reconfigurable and Fast Finite Field Multiplier Architecture
Yuan Dan-shou, Rong Meng-tian. Reconfigurable and Fast Finite Field Multiplier Architecture[J]. Journal of Electronics & Information Technology, 2006, 28(4): 717-720.
Authors:Yuan Dan-shou  Rong Meng-tian
Affiliation:Dept of Electronic Engineering, Shanghai Jiaotong Univ., Shanghai 200030, China
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.
Keywords:VLSI
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号