Normal basis of the finite field F(2(p-1)pm) over F-2

被引：1

作者：

Wang, MZ ^{[1
]}

Blake, IF ^{[1
]}

机构：

[1] UNIV WATERLOO, DEPT ELECT & COMP ENGN, WATERLOO, ON N2L 3G1, CANADA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 02期

关键词：

finite-field arithmetic; normal bases; dual bases;

D O I：

10.1109/18.556132

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The determination of normal bases for finite fields, particularly over the finite field IF2, is of importance in applications such as coding and cryptography. This correspondence gives an explicit normal basis for a finite field IF(2(p-1)p)m over IF2, when 2 is a primitive element module p(2). In the case when p=3, an explicit dual basis is also obtained.

引用

页码：737 / 739

页数：3

共 14 条

[11]

Perlis S., 1942, Duke Math. J., V9, P507

[12]

WAH PKS, 1984, P INT ZURICH SEMINAR, P175

[13] VLSI ARCHITECTURES FOR COMPUTING MULTIPLICATIONS AND INVERSES IN GF(2M). [J].

Wang, Charles C. ;

Truong, T.K. ;

Shao, Howard M. ;

Deutsch, Leslie J. ;

Omura, Jim K. ;

Reed, Irving S. .

IEEE Transactions on Computers, 1985, C-34 (08) :709-717

[14] A VLSI DESIGN FOR COMPUTING EXPONENTIATIONS IN GF(2M) AND ITS APPLICATION TO GENERATE PSEUDORANDOM NUMBER SEQUENCES [J].

WANG, CC ;

PEI, D .

IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (02) :258-262

← 1 2 →