ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술지 Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
Cited 24 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
Masaaki Shirase, Yukinori Miyazaki, Tsuyoshi Takagi, 한동국, 최두호
IEICE Transactions on Information and Systems, v.E92-D no.5, pp.909-917
일본, 전자정보통신학회 (IEICE)
09MS5600, 부채널 공격 방지 원천 기술 및 안전성 검증 기술개발, 최두호
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 ηtpairing 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. Copyright © 2009 The Institute of Electronics, Information and Communication Engineers.
KSP 제안 키워드
Efficient multiplication, ID-based, Information and communication, Limited resources, Optimization techniques(OT), Pairing-Based Cryptography, Security problems, Sensor node, cryptographic applications, current sensor, efficient implementation