Performance enhancement of TinyECC based on multiplication optimizations
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q4Scopus Q3
- 저널
- SECURITY AND COMMUNICATION NETWORKS6(2) · pp.151 · 2013
- 피인용
- Web of Science 12
- JCR IF
- JCR 2012 0.311
- ISSN
- 1939-0114
저자
초록
Because wireless sensor network (WSN), which is composed of a large number of low-cost and resource-constrained devices, communicates on the basis of wireless protocols such as IEEE 802.15.4, ZigBee, and DASH-7, it is easily vulnerable to eavesdropping, illegal modification, privacy infringement and denial-of-service attacks. These attacks destroy the data integrity, confidentiality, and authentication of the basic WSN security requirements and then the reliability and security of the WSN-based applications are deteriorated. There have been many research efforts to make secure WSN environments. Among these efforts, TinyECC is one of outstanding works. It provides several security protocols such as Elliptic Curve DiffieHellman, Elliptic Curve Digital Signature Algorithm, and Elliptic Curve Integrated Encryption Scheme, based on the Elliptic Curve Cryptography (ECC). TinyECC is basically a well-written TinyOS-based code and is optimized to resource-constrained environments. The Barrett reduction, hybrid multiplication, and several optimization techniques are also used for high performance even with low-energy consumption. However, the hybrid multiplication technique used in TinyECC is known to be not suitable for 16-bit processor, MSP430, which is a familiar processor for sensor node. This is due to the fact that the MSP 430 processor does not provide enough number of registers for hybrid multiplication techniques. Because the multiplication operation over the finite field is a major operation of the ECC, it causes a high latency of multiplication operations and eventually degrades the performance of the ECC operation. In this paper, we propose a novel multiplication operation based on the cached operands and reordered partial products. The proposed method shows that the latency of the polynomial multiplication, which is the core operation of the ECC, is 6% smaller than previously known results. Copyright (c) 2012 John Wiley & Sons, Ltd.
키워드
TinyECCsecurityinline assemblysensor networkMSP430hardware multiplicationIDENTITY-BASED ENCRYPTIONCRYPTOSYSTEMSCRYPTOGRAPHY
식별자
- WoS UID
- 000314180000003



로그인
연구물 목록으로