Browse > Article
http://dx.doi.org/10.13089/JKIISC.2008.18.3.45

Design of an Operator Architecture for Finite Fields in Constrained Environments  

Jung, Seok-Won (Mokpo National University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.18, no.3, 2008 , pp. 45-50 More about this Journal
Abstract
The choice of an irreducible polynomial and the representation of elements have influence on the efficiency of operators for finite fields. This paper suggests two serial multiplier for the extention field GF$(p^n)$ where p is odd prime. A serial multiplier using an irreducible binomial consists of (2n+5) resisters, 2 MUXs, 2 multipliers of GF(p), and 1 adder of GF(p). It obtains the mulitplication result after $n^2+n$ clock cycles. A serial multiplier using an AOP consists of (2n+5) resisters, 1 MUX, 1 multiplier of CF(p), and 1 adder of GF(p). It obtains the mulitplication result after $n^2$+3n+2 clock cycles.
Keywords
Finite Fields; Irreducible Binomials; All One Polynomials; Redundant Bases; Multiplier; Serial Architecture;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 조용석, "유한체 상에서 고속연산을 위한 직렬 곱셈기의 병렬화 구조", 정보보호학회 논문지 제17권 제l호, pp.33-39, 2007   과학기술학회마을
2 J. Beuchat, M. Shirase, T. Takagi, E. Oka-mo-to, "An Algorithm for the Eta_T Pairing Calcuation in Characteristics Three and its Hardware Implementation." 18th IEEE International Symposium on Computer Arithmetic, ARITH-18, pp.97-104, 2007
3 J. L. Massey and J. K. Omura, "Computational method and apparatus for finite field arithmetic", U. S. Patent No. 4587627, 1984
4 R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone, "Optimal Normal Bases in GF($_{p^m}$)", Discrete Applied Mathematics 22, pp.149-161, 1987   DOI   ScienceOn
5 M. Weiser, "The Computer for the 21 Centry, Scientific American", Vol. 256, No. 3, pp.94-104, 1991
6 H. Wu, "Efficient Computations in Finite Fields with Cryptographic Significance", Ph.D Thesis in Computer Engineering, Univ. of Waterloo, Canada, 1999
7 D. V. Bailey and C. Paar, "Optimal Extension Fields for Fast Arithmetic in Public Key Algorithm", Advanced in Cryptology-CRYPTO'98, LNCS 1462, pp.472-458, 1998
8 R. Lidi and H. Neiderrieter, "Finite Fields", Encyclopedia of Marthematics and its Applications, vol. 20, Addison-Wesley, 1983
9 이진호, 김현성, "GF(2m) 상에서 디지트 단위 모듈러 곱셈/제곱을 위한 시스톨릭 구조", 정보보호학회 논문지 제18권 제1호, pp.41-47, 2008   과학기술학회마을
10 G. Bertoni, L. Breveglieri, P. Fragneto, and G. Pelosi, "parallel Hardware Architectures for the Cryptographic Tate Pairing," Proceedings of the Third International Conference on Information Technology : New Generations (ITNG'06), pp.186-191, 2006
11 C. Paar, "A new architecture for a parallel finite field multiplier with low complexity based on composite fields", IEEE Trans on computers, vol.45, No 7, pp.856-861, 1996   DOI   ScienceOn
12 이옥석, 장남수, 김창한, 홍석희, "Equally Spaced 기약다항식 기반의 효율적인 이진체 비트-병렬 곱셈기", 정보보호학회 논문지 제18권 제2호, pp.3-9, 2008   과학기술학회마을
13 조용석, "GF(2m) 상의 저복잡도 고속-직렬 곱셈기 구조", 정보보호학회 논문지 제17권 제4호, pp.97-102, 2008   과학기술학회마을
14 P. Grabher and D. Page, "Hardware Acceleration of the Tate Pairing in Characteristic Three," CHES 2005, LNCS 3659, pp.398-411, Springer-Verlag, 2005
15 A. J. Menezes, "Application of Finite Fields", Kluwer Academic Publishers, 1993