Low-energy finite field arithmetic primitives for implementing security in wireless sensor networks

Affordable Access

Low-energy finite field arithmetic primitives for implementing security in wireless sensor networks

Authors
Publisher
Institute of Electrical and Electronics Engineers
Keywords
  • Wireless Sensor Networks
  • Cryptography
  • Computer Networks
  • Arithmetic
  • Computer Security
  • Telecommunication Security

Abstract

In this paper we propose the use of identity based encryption (IBE) for ensuring a secure wireless sensor network. In this context we have implemented the arithmetic operations required for the most computationally expensive part of IBE, which is the Tate pairing, in 90 nm CMOS and obtained area, timing and energy figures for the designs. Initial results indicate that a hardware implementation of IBE would meet the strict energy constraint of a wireless sensor network node

There are no comments yet on this publication. Be the first to share your thoughts.