Browse > Article

Efficient Algorithms for Finite Field Operations on Memory-Constrained Devices  

Han, Tae-Youn (인하대학교 컴퓨터공학부)
Lee, Mun-Kyu (인하대학교 컴퓨터정보공학부)
Abstract
In this paper, we propose an efficient computation method over GF($2^m$) for memory-constrained devices. While previous methods concentrated only on fast multiplication, we propose to reduce the amount of required memory by cleverly changing the order of suboperations. According to our experiments, the new method reduces the memory consumption by about 20% compared to the previous methods, and it achieves a comparable speed with them.
Keywords
Finite field; Binary field; GF($2^m$); memory-constrained device;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L. B. Oliveira, M.Scoot, J.Lopez, and R. Dahab, TinyPBC : Pairings for authenticated identity-based noninteractive key distribution in sensor networks, Cryptology ePrint Archive, Report 2007/482, 2007
2 BURD, T. D., AND BRODERSEN, R. W. Energy eficient CMOS microprocessor design. In Procee-dings of the 28th Annual Hawaii International Conference on System Sciences. Volume 1: Archi-tecture (Los Alamitos, CA, USA, Jan. 1995), T. N. Mudge and B. D. Shriver Eds., IEEE Computer Society Press, pp. 288-297   DOI
3 M.Scott, Optimal irreducible polynomials for $GF(2^{m})$ arithmetic, Cryptology ePrint Archive, Report 2007/192, 2007
4 A. Karatsuba And Y. Ofman, Multiplication of multidigit numbers on automa, Soviet Physics-Doklad, Vol.7, No.7, pp. 595-596, 1993
5 M.Scott, MIRACL - A Multiprecision Integer and Rational Arithmetic C++ Library, Shamus Soft-ware Ltd., Dublin, Ireland, 2003
6 S.C.Seo, D.G.Han, H.C.Kim, and S.Hong, TinyECCK: Efficient elliptic curve crytography implemen-tation over $GF(2^{m})$ on 8-bit micaz mote, IEICE Transactions, Vol.42, No.3, pp. 239-271, 2007   DOI
7 A. Liu and P.Ning, TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks, Proceedings of the 2008 inter-national Conference on Information Processisng in Sensor Networks (IPSN 2008), Washington, DC, USA, pp. 245-256, IEEE Computer Society, 2008   DOI