TelosB Implementation of Elliptic Curve Cryptography over Primary Field WM-CS Technical Report (WM-CS-2005-12)

Even though symmetric-key scheme, which has been investigated extensively for sensor networks, can fulfill many security requirements, public-key cryptography is more flexible and simple rendering a clean interface for the security component. Against the popular belief that public key scheme is not practical for sensor networks, this paper describes a public-key implementation in a sensor network. We detail the implementation of Elliptic Curve Cryptography (ECC) over primary field, a public-key cryptography scheme, on TelosB, which is the latest research platform in Berkeley Motes family. We evaluate the performance of our implementation and compare with other implementations we have ported to TelosB. We have achieved 3.3 seconds for public key signature and 6.7 seconds for verification in our implementation even though the hardware multiplier is disabled.

[1]  David E. Culler,et al.  The nesC language: A holistic approach to networked embedded systems , 2003, PLDI '03.

[2]  Hans Eberle,et al.  Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.

[3]  Atsuko Miyaji,et al.  Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[4]  S. C. Shantz.  From Euclid's GCD to Montgomery Multiplication to the Great Divide , 2001 .

[5]  尚弘 島影.  National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[6]  Christof Paar,et al.  Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.

[7]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[8]  Christof Paar,et al.  Elliptic Curve Cryptography on Smart Cards without Coprocessors , 2001, CARDIS.

[9]  Vipul Gupta,et al.  Sizzle: a standards-based end-to-end security architecture for the embedded Internet , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[10]  Mitsuru Matsui,et al.  A Practical Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-bit Microcomputer , 1998, Public Key Cryptography.

[11]  J. Olivos,et al.  Speeding up the computations on an elliptic curve using addition-subtraction chains , 1990, RAIRO Theor. Informatics Appl..

[12]  Atsuko Miyaji,et al.  Efficient elliptic curve exponentiation , 1997, ICICS.

[13]  Michael D. Smith,et al.  A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..