An efficient implementation of pairing-based cryptography on MSP430 processor

Jihoon Kwon, Seog Chung Seo, Seokhie Hong

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)1-24
Number of pages24
JournalJournal of Supercomputing
DOIs
Publication statusAccepted/In press - 2017 Jul 17

Fingerprint

Pairing-based Cryptography
Efficient Implementation
Pairing
Cryptography
Field extension
Data storage equipment
Finite Field Arithmetic
Sensors
Sensor
Usability
Multiplication

Keywords

  • Efficient implementation
  • MSP430 processor
  • Pairing-based cryptography
  • Wireless sensor networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

An efficient implementation of pairing-based cryptography on MSP430 processor. / Kwon, Jihoon; Seo, Seog Chung; Hong, Seokhie.

In: Journal of Supercomputing, 17.07.2017, p. 1-24.

Research output: Contribution to journalArticle

@article{4fb8b0d91e05467cba095dda212439c8,
title = "An efficient implementation of pairing-based cryptography on MSP430 processor",
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.",
keywords = "Efficient implementation, MSP430 processor, Pairing-based cryptography, Wireless sensor networks",
author = "Jihoon Kwon and Seo, {Seog Chung} and Seokhie Hong",
year = "2017",
month = "7",
day = "17",
doi = "10.1007/s11227-017-2097-4",
language = "English",
pages = "1--24",
journal = "The Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - An efficient implementation of pairing-based cryptography on MSP430 processor

AU - Kwon, Jihoon

AU - Seo, Seog Chung

AU - Hong, Seokhie

PY - 2017/7/17

Y1 - 2017/7/17

N2 - 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.

AB - 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.

KW - Efficient implementation

KW - MSP430 processor

KW - Pairing-based cryptography

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=85024490322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85024490322&partnerID=8YFLogxK

U2 - 10.1007/s11227-017-2097-4

DO - 10.1007/s11227-017-2097-4

M3 - Article

SP - 1

EP - 24

JO - The Journal of Supercomputing

JF - The Journal of Supercomputing

SN - 0920-8542

ER -