Architectural support for fast symmetric-key cryptography
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
The Design of Rijndael
An Experimental Analysis of Cryptographic Overhead in Performance-Critical Systems
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Analyzing and modeling encryption overhead for sensor network nodes
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
State of the Art in Ultra-Low Power Public Key Cryptography for Wireless Sensor Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Survey and benchmark of block ciphers for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Avrora: scalable sensor network simulation with precise timing
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Hi-index | 0.00 |
Resource constraints make it considerably difficult to implement and optimize cryptography algorithms on sensor nodes. In order to provide guidelines for design, it is necessary to predict overheads of these algorithms without final implementations and optimizations. In this paper, a mathematical model based on overheads of basic operations frequently used in cryptography algorithms is presented for predicting overheads of these algorithms. Simulation results of practical implementations of several popular algorithms verify that this model is very accurate. Because these basic operations cannot be ignored when implementing cryptography algorithms, the prediction results can be used as lower bounds of overheads. More importantly, as these basic operations are also elements of other applications such as data processing, their overheads can also be used to predict overheads of those applications using the same method.