Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
スポンサーリンク
概要
- 論文の詳細を見る
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.93sec, 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.
- （社）電子情報通信学会の論文
- 2009-05-01
著者
-
SHIRASE Masaaki
Future University Hakodate (FUN)
-
Takagi Tsuyoshi
Future Univ.‐hakodate Hakodate‐shi Jpn
-
Han Dong‐guk
Kookmin Univ. Seoul Kor
-
Han Dong-guk
Dept. Of Mathematics Kookmin University
-
Choi Dooho
Electronics And Telecommunications Research Institute (etri)
-
MIYAZAKI Yukinori
Future University Hakodate (FUN)
-
Shirase Masaaki
Future Univ. Hakodate (fun) Hakodate‐shi Jpn
-
Masaaki Shirase
Future University Hakodate (FUN)
-
Yukinori Miyazaki
Future University Hakodate (FUN)
-
Tsuyoshi Takagi
Future University Hakodate (FUN)
-
Dong-Guk Han
Dept. of Mathematics, Kookmin University
-
Dooho Choi
Electronics and Telecommunications Research Institute (ETRI)
関連論文
- Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing
- Efficient Implementation of the Pairing on Mobilephones Using BREW
- Generalized Powering Functions and Their Application to Digital Signatures(Digital Signature, Cryptography and Information Security)
- Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party
- Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
- Countermeasures against Power Analysis Attacks for the NTRU Public Key Cryptosystem
- TinyECCK16 : An Efficient Field Multiplication Algorithm on 16-bit Environment and Its Application to Tmote Sky Sensor Motes
- TinyECCK : Efficient Elliptic Curve Cryptography Implementation over GF(2^m) on 8-Bit Micaz Mote
- Defeating Simple Power Analysis on Koblitz Curves(Discrete Mathematics and Its Applications)
- Security Analysis of the SPA-Resistant Fractional Width Method(Elliptic Curve Cryptography, Cryptography and Information Security)
- Cryptanalysis of Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication(Discrete Mathematics and Its Applications)
- A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems(Discrete Mathematics and Its Applications)
- Acceleration of Differential Power Analysis through the Parallel Use of GPU and CPU
- Universal Construction of a 12th Degree Extension Field for Asymmetric Pairing
- Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
- A More Compact Representation of XTR Cryptosystem
- Efficient Hyperelliptic Curve Cryptosystems Using Theta Divisors(Elliptic Curve Cryptography, Cryptography and Information Security)
- Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
- Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
- Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
- Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
- Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
- Performance Improvement of Power Analysis Attacks on AES with Encryption-Related Signals