The search functionality is under construction.
The search functionality is under construction.

Efficient Implementation of Pairing-Based Cryptography on a Sensor Node

Masaaki SHIRASE, Yukinori MIYAZAKI, Tsuyoshi TAKAGI, Dong-Guk HAN, Dooho CHOI

  • Full Text Views

    0

  • Cite this

Summary :

Pairing-based cryptography provides us many novel cryptographic applications such as ID-based cryptosystems and efficient broadcast encryptions. The security problems in ubiquitous sensor networks have been discussed in many papers, and pairing-based cryptography is a crucial technique to solve them. Due to the limited resources in the current sensor node, it is challenged to optimize the implementation of pairings on sensor nodes. In this paper we present an efficient implementation of pairing over MICAz, which is widely used as a sensor node for ubiquitous sensor network. We improved the speed of ηT pairing by using a new efficient multiplication specialized for ATmega128L, called the block comb method and several optimization techniques to save the number of data load/store operations. The timing of ηT pairing over GF(2239) achieves about 1.93 sec, which is the fastest implementation of pairing over MICAz to the best of our knowledge. From our dramatic improvement, we now have much high possibility to make pairing-based cryptography for ubiquitous sensor networks practical.

Publication
IEICE TRANSACTIONS on Information Vol.E92-D No.5 pp.909-917
Publication Date
2009/05/01
Publicized
Online ISSN
1745-1361
DOI
10.1587/transinf.E92.D.909
Type of Manuscript
Special Section PAPER (Special Section on Information and Communication System Security)
Category
Implementation Issues

Authors

Keyword