Analyzing and Modeling Encryption Overhead For Sensor Network Nodes (2003)
Cached
Download Links
- [moss.csc.ncsu.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.cs.berkeley.edu]
- [now.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. 2ND ACM INTERNATIONAL CONFERENCE ON WIRELESS SENSOR NETWORKS AND APPLICATIONS, 2003 |
| Citations: | 23 - 0 self |
BibTeX
@INPROCEEDINGS{Ganesan03analyzingand,
author = {Prasanth Ganesan and Ramnath Venugopalan and Pushkin Peddabachagari and Alexander Dean and Frank Mueller and Mihail Sichitiu},
title = {Analyzing and Modeling Encryption Overhead For Sensor Network Nodes},
booktitle = {IN PROC. 2ND ACM INTERNATIONAL CONFERENCE ON WIRELESS SENSOR NETWORKS AND APPLICATIONS, 2003},
year = {2003},
pages = {151--159},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in the field. Limitations in processing power, battery life, communication bandwidth and memory constrain the applicability of existing cryptography standards for small embedded devices. A mismatch between wide arithmetic for security (32 bit word operations) and embedded data bus widths (often only 8 or 16 bits) combined with lack of certain operations (e.g., multiply) in the ISA present other challenges. This paper
