Abstract
In this paper, we present a highly optimized implementation of (Formula presented.) pairing on 16-bit MSP430 processor. Until now, TinyPBC provided the most optimized implementation of (Formula presented.) pairing on sensor platforms. Although it is well optimized for finite field arithmetic, it is not optimized at an extension field arithmetic level. Moreover, since TinyPBC requires considerable amount of memory consumption, its usability is limited on a memory-constrained sensor platforms. We have focused on optimizing not only field arithmetic level but also extension field arithmetic level. In comparison with TinyPBC, the field reduction performance could be improved about 29.1% by our proposed method. We achieved 12.22% of performance improvement for extension field sparse multiplication. Our (Formula presented.) pairing implementation on MSP430 computes single pairing in 1.22 s, and this result is 5.88% faster than TinyPBC. Furthermore, it requires 19.2% less memory than TinyPBC.
Original language | English |
---|---|
Pages (from-to) | 1-24 |
Number of pages | 24 |
Journal | Journal of Supercomputing |
DOIs | |
Publication status | Accepted/In press - 2017 Jul 17 |
Keywords
- Efficient implementation
- MSP430 processor
- Pairing-based cryptography
- Wireless sensor networks
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Information Systems
- Hardware and Architecture