Browse > Article
http://dx.doi.org/10.13067/JKIECS.2013.8.8.1207

Fast Sequential Optimal Normal Bases Multipliers over Finite Fields  

Kim, Yong-Tae (광주교육대학교 수학교육과)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.8, no.8, 2013 , pp. 1207-1212 More about this Journal
Abstract
Arithmetic operations over finite fields are widely used in coding theory and cryptography. In both of these applications, there is a need to design low complexity finite field arithmetic units. The complexity of such a unit largely depends on how the field elements are represented. Among them, representation of elements using a optimal normal basis is quite attractive. Using an algorithm minimizing the number of 1's of multiplication matrix, in this paper, we propose a multiplier which is time and area efficient over finite fields with optimal normal basis.
Keywords
Finite Field; Finite Field Arithmetic; Optimal Normal Basis; Sequential Multiplier;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 J. Massey, J. Omura, "Computational methd and apparatus for finite field arithmetic", US Patent No. 4587627, 1986.
2 G. Agnew, R. Mullin, S. Vanstone, "An implementation for a fast public key cryptosystem", Journal of Cryptography, Vol. 3, pp. 63-79, 1999.
3 Y. Kim, "Efficient Serial Gaussian Normal Basis Multipliers over Binary Extension Fields", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 4, No. 3, pp. 197-203, 2009.   과학기술학회마을
4 A. Reyhani-Maslleh and M.H. Hasan, "Efficient Digit Serial Normal Basis Multiplier over Binary Extension Fields", ACM Trans. on Embedded Systems and Security Vol. 3, pp. 575-592, 2004.   DOI
5 S.J. Cho, J.G. Kim, U.S. Choi, S.T. Kim, "Cross-correlation of linear and nonlinear GMW-sequences generated by the same primitive polynomial on ", The Korea Institute of Electronic Communication Sciences 2011 Spring Conference Vol. 5, No. 1, pp. 155-158, 2011.
6 Han-Doo Kim, Sung-Jin Cho, Min-Jeong Kwon, Hyun-Ju An, " A study on the cross-correlation function of extended Zeng sequences", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 7, No. 1, pp. 61-67, 2012.
7 S. Gao Jr. and H.W. Lenstra, "Optimal normal bases", Designs, Codes and Cryptology, Vol. 2, pp. 315-323, 1992.   DOI
8 Y. Kim, "A Fast Multiplier of Composite fields over finite fields", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 6, No. 3, pp. 389-395, 2011.   과학기술학회마을
9 ANSI, "Public Key Cryptology for the Financial Service Industry : The Elliptic Curve Digital Signature Algorithm(ECDSA)", ANSI x9.62, 1998.
10 NIST, Digital Signature Standard, FIPS Publication, 186-2, 2000.
11 U.S. Choi, S.J. Cho, "Design of Binary Sequence with optimal Cross-correlation Values", The Journal of The Korea Institute of Electronic Communication Sciences, Vol. 6, No. 4, pp. 539-544, 2011.