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

Efficient Finite Field Arithmetic Architectures for Pairing Based Cryptosystems  

Chang, Nam-Su (Graduate School of Information Management and Security, Korea University)
Kim, Tae-Hyun (Graduate School of Information Management and Security, Korea University)
Kim, Chang-Han (School of Information & Communication systems, Semyung University)
Han, Dong-Guk (Electronics and Telecommunications Research Institute)
Kim, Ho-Won (School of computer science and engineering in Pusan National University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.18, no.3, 2008 , pp. 33-44 More about this Journal
Abstract
The efficiency of pairing based cryptosystems depends on the computation of pairings. pairings is defined over finite fileds GF$(3^m)$ by trinomials due to efficiency. The hardware architectures for pairings have been widely studied. This paper proposes new adder and multiplier for GF(3) which are more efficient than previous results. Furthermore, this paper proposes a new unified adder-subtractor for GF$(3^m)$ based on the proposed adder and multiplier. Finally, this paper proposes new multiplier for GF$(3^m)$. The proposed MSB-first bit-serial multiplier for GF$(p^m)$ reduces the time delay by approximately 30 % and the size of register by half than previous LSB-first multipliers. The proposed multiplier can be applied to all finite fields defined by trinomials.
Keywords
Pairing based cryptosystems; Finite Field Arithmetic; Bit-Serial Multiplier;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P.S.L.M Barreto, S. Galbraith, C. O hEigeartaigh and M. Scott, "Efficient Pairing Computation on Supersingular Abelian Varieties," Designs, Codes and Cryptography, Vol.42, No.3, pp.239-271, 2007   DOI
2 P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, "Efficient algorithm for pairing-based crypto systems," CRYPTO 2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002
3 G. Bertoin, J. Guajardo, S. Kumar, G. Orlando C. Paar and T. Wollinger. "Efficient GF$_{p^m}$ Arith metic Architectures for Cryptographic Applications," CT-RSA 2003, LNCS 2612, pp.158-175 Springer-Verlag, 2003
4 I. Duursma and H.-S. Lee, "Tate pairing implementation for hyper elliptic curves y$^2$=x$^p$-x+d," Asiacrypt 2003, LNCS 2894, pp.111-123, Springer-Verlag, 2003
5 S.D. Galbraith, K. Harrison, and D. Soldera, "Implementing the Tate pairing," ANTS V, LNCS 236 9, pp.324-337, Springer-Verlag, 2002
6 S. Kwon, "Efficient Tate pairing computation for elliptic curves over binary fields," ACISP 2005, LNCS 3574, pp.134-145, Springer-Verlag, 2005
7 D. Page and N. Smart "Hardware Implementation of Finite Fields of Characteristic Three," CHES 2002, LNCS 2523, pp.529-539, Springer-Verlag, 2003
8 T. Kerins, E. M. Popovici and W. P. Marnane, "Algorithms and Architectures for use in FPGA implementations of Identity Based Encryption Schemes," FPL 2004, LNCS 3203, pp.74-83, Springer-Verlag, 2004
9 V. SMiller short Programs for functions on curves. Unpublished manuscript, 1986. http://clypto.sta.nford.edu/miller/miller.pdf
10 P. Grabher and D. Page, "Hardware Acceleration of the Tate Pairing in Characteristic Three," CHES 2005, LNCS 3659, pp.398-411, Springer-Verlag, 2005
11 G. Bertoin, L. Breveglieri, P. Fragneto, and G. Pelosi, "Parallel Hardware Architectures for the Clyptographic Tate Pairing," Proceedings of the Third International Conference on Information Technology : New Generations (ITNG'06), pp.186-191, 2006
12 R. Granger, D. Page, and M. Stam, "Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three," IEEE Transactions on Computers, Vol.54, No 7, pp.852-860, July 2005   DOI   ScienceOn
13 T. Kerins, W. Marnane, E. Popovici, P. S. L. M. Barreto "Efficient Hardware for the Tate Pairing Calculation in Characteristic Three," CHES 2005, LNCS 3659, pp.398-411, Springer-Verlag, 2005
14 J. Beuchat, T. Miyoshi, Y. Oyama, E. Okamoto, "Multiplication over $F_{p^m}$： on FPGA : A Survey", ARC-2007, LNCS 4419, pp.214-225, Springer-Verlag, 2007
15 J. Beuchat, M. Shirase, T. Takagi, E. Okamoto, "An Algorithm for the Eta_T Pairing Calculation in Characteristic Three and its Hardware Implementation", 18th IEEE International Symposium on Computer Arithmetic, ARIT H-18, pp.97-104, 2007