Efficient Implementation of Pairing-Based Cryptography on a Sensor Node

Shirase, Masaaki; Miyazaki, Yukinori; Takagi, Tsuyoshi; Han, Dong; Choi, Dooho

doi:10.1587/transinf.e92.d.909

Cited by 23 publications

(16 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This method executes consecutive bitwise exclusive‐or on intermediate results under condition of bit setting by block‐wise . Over AVR processor, 6 bytes are recommended as a suitable block size by considering the number of 8‐bit general purpose registers (32 registers in AVR).…”

Section: Related Workmentioning

confidence: 99%

“…Nonetheless, advanced binary field implementations can achieve remarkably good performance by reducing the number of partial products and replacing bit operations for binary multiplication to look‐up table access known as Lopez et al 's method . The alternative approach, Block‐Comb‐based multiplication is introduced in in which several operands are grouped in block‐wise and multiplication is computed in group‐wise fashion. Recently, an unbalanced fashion of Block‐Comb method is presented by Seo et al in .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields

Seo

Liu

Choi

et al. 2015

Security Comm. Networks

View full text Add to dashboard Cite

Efficient implementation of elliptic curve cryptography on resource‐constrained microcontroller is considered to be one of the hot and challenging research topics because of the limited computing power and storages of target platforms and high computational costs of elliptic curve cryptography. In this paper, we focus on enhancing the performance of scalar multiplication over GF(2m) by suggesting a new technique for speeding up the performance of multiplication, called Karatsuba–Block‐Comb (KBC) multiplication. KBC method combines both the advantages of Karatsuba algorithm and Block‐Comb method. This technique replaces the part of expensive Block‐Comb binary field multiplications with several cheap additions by following Karatsuba rule. In case of squaring, we describe an optimized squaring algorithm with 8‐bit look‐up table that is significantly faster than previous works with 4‐bit look‐up table. Both of the proposed approaches improve the best known results by a factor of 24.6% and 16.8% (160‐bit operand) over 8‐bit AVR processor (Atmel Corporation, San Jose, CA, USA), respectively. Finally, we realize the scalar multiplication over GF(2163), which only requires 0.29 s for a full scalar multiplication when the processor runs at 7.37 MHz. This result outperforms the previous best implementation by a factor of 9.3%. The research results presented in this paper prove that it is also possible to achieve high performance over binary fields by combing the algorithm with sub‐quadratic complexity. Furthermore, we suggest constant time KBC method. Block‐Comb method does not provide constant time, and look‐up table method is also vulnerable to memory address side channel attack. However, our method is establishing the scalar multiplication in 0.35 s with high security against both attacks. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields

Seo

Liu

Choi

et al. 2015

Security Comm. Networks

View full text Add to dashboard Cite

show abstract

“…This method executes multiplication with a partial product of the block size [12]. In Figure 5, gray blocks represent the multiplication size, and A[0-1] and B[0-1] are the sources for the first partial block product, based on which each bit will be tested and the result registers updated.…”

Section: Block Combmentioning

confidence: 99%

Binary and prime field multiplication for public key cryptography on embedded microprocessors

Seo

Lee

Kim

et al. 2013

Security Comm. Networks

View full text Add to dashboard Cite

Embedded microprocessors are used in a wide variety of platforms, including Radio frequency identification (RFID) systems, sensor networks, and smartphones. Unfortunately, as practical use of microprocessors has increased, so have the security problems associated with them. Although public key cryptography (PKC) can mitigate these problems, standard implementations of PKC also impose a steep computational cost on resource-constrained devices. To reduce this cost, researchers have proposed alternative implementations that accelerate multiprecision multiplication, the most expensive operation involved in PKC. In this paper, we focus on a further optimization of this same operation, using several innovative methods: carry-once, optimized multiplication and accumulation (MAC), unbalanced comb, and optimized comb-window. These methods yield further performance improvements of 2%, 17%, 4.5%, and 9.5%, respectively, on representative modern microprocessors including ATmega128 and MSP430.

show abstract

“…After that, identity-based cryptography was an open problem for seventeen years, until Boneh and Franklin could represent the first Provably-Secure identity-based encryption scheme in random-oracle model and under BDH (Certification Authority) assumption [22]. [5], [6] Making pairing operations more efficient in the term of speed of running.…”

Section: Seyed-mohsen Ghoreishi and Ismail Fauzi Isninmentioning

confidence: 99%

Secure Lightweight Pairing-Based Key-Agreement Cryptosystems: Issues and Challenges

Ghoreishi¹,

Isnin²

2013

IJET

View full text Add to dashboard Cite

Abstract-Although a large number of pairing-based key-agreement cryptosystems have been proposed, there are still a lot of drawbacks. One of the most important disadvantages of mentioned cryptographic functions is that there is not a comprehensive system to satisfy both security and efficiency requirements. Moreover, there is not an integrated document to categorize and present possible challenges. Therefore, we paid particular attention to this issue, unlike other surveys in the area of key-agreement cryptosystems. In this paper, we presented a new method to address possible challenges. Actually, we claim that unlike existing documents, this paper determines possible challenges and open problems in the area of lightweight pairing-based key-agreement cryptosystems. We expect that our findings make other researchers able to classify all presented cryptosystems in this area and help them to follow the best way to solve possible problems in the future researches.Index Terms-Key-agreement, lightweight, pairing-based.

show abstract

Efficient Implementation of Pairing-Based Cryptography on a Sensor Node

Cited by 23 publications

References 20 publications

Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields

Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields

Binary and prime field multiplication for public key cryptography on embedded microprocessors

Secure Lightweight Pairing-Based Key-Agreement Cryptosystems: Issues and Challenges

Contact Info

Product

Resources

About