Run-time Selection of Security Algorithms For Networked Devices

One of the most important challenges that need to be currently faced in securing resource-constrained embedded systems is optimizing the trade-off between resources used (energy consumption and computational capabilities required) and security requirements for cryptographic algorithms any adopted security solutions should guarantee an adequate level of protection, yet respecting constraints on computational resources and consumed power. In this paper a generic, efficient, and energy-aware mechanism to determine a correct: trade off between security requirements and resources consumed is proposed. The solution proposed relies on Analytic Hierarchy Process (AHP) to define priorities among different requirements and to compare different security solutions. A knapsack problem is formulated to select. the most relevant algorithms based on their utility and on available resources.