Efficient software implementation of public-key cryptography on sensor networks using the MSP430X microcontroller

被引:35
作者
Gouvea, Conrado P. L. [1 ]
Oliveira, Leonardo B. [2 ]
Lopez, Julio [1 ]
机构
[1] Univ Estadual Campinas, Campinas, SP, Brazil
[2] Univ Fed Minas Gerais, Belo Horizonte, MG, Brazil
基金
巴西圣保罗研究基金会;
关键词
Efficient software implementation Elliptic curve cryptography; Pairing-based cryptography; MSP430;
D O I
10.1007/s13389-012-0029-z
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this work, we describe a software implementation of elliptic curve cryptography and pairing-based cryptography for the MSP430 microcontroller family, which is used in wireless sensors. Digital signature, short signature and key distribution protocols were implemented at the 80-and 128-bit levels of security, over both binary and prime fields. The timing results of our software implementation show an improvement of about 25-30% in the pairing computation over previous implementations. We also provide results for the MSP430X extension of the original family, which has new instructions. In particular, using the new32-bit hardware multiplier available in some MSP430X models, we have achieved a further improvement of about 45% in the prime field multiplication and 20-30% in protocol timings. The combination of fast algorithms and improved hardware allows us to show that even the 128-bit level of security can be considered feasible for this platform.
引用
收藏
页码:19 / 29
页数:11
相关论文
共 47 条
[1]   A new addition formula for elliptic curves over GF(2n) [J].
Al-Daoud, E ;
Mahmod, R ;
Rushdan, M ;
Kilicman, A .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (08) :972-975
[2]  
[Anonymous], 2000, CERTICOM RES SEC 2 R
[3]  
Aranha DF, 2011, LECT NOTES COMPUT SC, V6632, P48, DOI 10.1007/978-3-642-20465-4_5
[4]   EFFICIENT IMPLEMENTATION OF ELLIPTIC CURVE CRYPTOGRAPHY IN WIRELESS SENSORS [J].
Aranha, Diego F. ;
Dahab, Richardo ;
Lopez, Julio ;
Oliveira, Leonardo B. .
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2010, 4 (02) :169-187
[5]   Faster computation of the Tate pairing [J].
Arene, Christophe ;
Lange, Tanja ;
Naehrig, Michael ;
Ritzenthaler, Christophe .
JOURNAL OF NUMBER THEORY, 2011, 131 (05) :842-857
[6]   Efficient pairing computation on supersingular Abelian varieties [J].
Barreto, Paulo S. L. M. ;
Galbraith, Steven D. ;
O'hEigeartaigh, Colm ;
Scott, Michael .
DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) :239-271
[7]  
Barreto PSLM, 2006, LECT NOTES COMPUT SC, V3897, P319
[8]  
Bernstein DJ, 2007, LECT NOTES COMPUT SC, V4833, P29
[9]  
BERNSTEIN DJ, 2001, 5 WORKSH ELL CURV CR
[10]   Short signatures from the Weil pairing [J].
Boneh, D ;
Lynn, B ;
Shacham, H .
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :297-319