Bit-serial multiplication in GF(2m) using irreducible all-one polynomials

被引:31
作者
Fenn, STJ [1 ]
Parker, MG
Benaissa, M
Taylor, D
机构
[1] Univ Huddersfield, Dept Elect & Elect Engn, Huddersfield HD1 3DH, W Yorkshire, England
[2] Univ Bradford, Dept Elect & Elect Engn, Bradford BD7 1DP, W Yorkshire, England
来源
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | 1997年 / 144卷 / 06期
关键词
bit-serial multipliers; Reed-Solomon codes; VLSI; cryptography;
D O I
10.1049/ip-cdt:19971586
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Two architectures for carrying out bit-serial multiplication in GF(2(m)) are presented where the defining irreducible polynomial for the field is an all-one polynomial. The multipliers presented have low hardware requirements, regular structures and are therefore suitable for VLSI implementation.
引用
收藏
页码:391 / 393
页数:3
相关论文
共 12 条
[1]   BIT-SERIAL REED-SOLOMON ENCODERS [J].
BERLEKAMP, ER .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :869-874
[2]  
DRAY GN, 1997, ELECT COMMUN ENG J, V9, P11
[3]   GF(2(m)) multiplication and division over the dual basis [J].
Fenn, STJ ;
Benaissa, M ;
Taylor, D .
IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (03) :319-327
[4]   MODULAR CONSTRUCTION OF LOW COMPLEXITY PARALLEL MULTIPLIERS FOR A CLASS OF FINITE-FIELDS GF(2(M)) [J].
HASAN, MA ;
WANG, MZ ;
BHARGAVA, VK .
IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (08) :962-971
[5]   A MODIFIED MASSEY-OMURA PARALLEL MULTIPLIER FOR A CLASS OF FINITE-FIELDS [J].
HASAN, MA ;
WANG, MZ ;
BHARGAVA, VK .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (10) :1278-1280
[6]  
Hoeve H., 1982, Philips Technical Review, V40, P166
[7]   A COMPARISON OF VLSI ARCHITECTURE OF FINITE-FIELD MULTIPLIERS USING DUAL, NORMAL, OR STANDARD BASES [J].
HSU, IS ;
TRUONG, TK ;
DEUTSCH, LJ ;
REED, IS .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (06) :735-739
[8]   STRUCTURE OF PARALLEL MULTIPLIERS FOR A CLASS OF FIELDS GF(2M) [J].
ITOH, T ;
TSUJII, S .
INFORMATION AND COMPUTATION, 1989, 83 (01) :21-40
[9]  
Lidl R., 1986, INTRO FINITE FIELDS
[10]  
MASTROVITO ED, 1991, THESIS LINKOPING U S