981 research outputs found
Survey and Benchmark of Block Ciphers for Wireless Sensor Networks
Cryptographic algorithms play an important role in the security architecture of wireless sensor networks (WSNs). Choosing the most storage- and energy-efficient block cipher is essential, due to the facts that these networks are meant to operate without human intervention for a long period of time with little energy supply, and that available storage is scarce on these sensor nodes. However, to our knowledge, no systematic work has been done in this area so far.We construct an evaluation framework in which we first identify the candidates of block ciphers suitable for WSNs, based on existing literature and authoritative recommendations. For evaluating and assessing these candidates, we not only consider the security properties but also the storage- and energy-efficiency of the candidates. Finally, based on the evaluation results, we select the most suitable ciphers for WSNs, namely Skipjack, MISTY1, and Rijndael, depending on the combination of available memory and required security (energy efficiency being implicit). In terms of operation mode, we recommend Output Feedback Mode for pairwise links but Cipher Block Chaining for group communications
Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices
Networks are evolving toward a ubiquitous model in which heterogeneous
devices are interconnected. Cryptographic algorithms are required for developing security
solutions that protect network activity. However, the computational and energy limitations
of network devices jeopardize the actual implementation of such mechanisms. In this
paper, we perform a wide analysis on the expenses of launching symmetric and asymmetric
cryptographic algorithms, hash chain functions, elliptic curves cryptography and pairing
based cryptography on personal agendas, and compare them with the costs of basic operating
system functions. Results show that although cryptographic power costs are high and such
operations shall be restricted in time, they are not the main limiting factor of the autonomy
of a device
Transparent code authentication at the processor level
The authors present a lightweight authentication mechanism that verifies the authenticity of code and thereby addresses the virus and malicious code problems at the hardware level eliminating the need for trusted extensions in the operating system. The technique proposed tightly integrates the authentication mechanism into the processor core. The authentication latency is hidden behind the memory access latency, thereby allowing seamless on-the-fly authentication of instructions. In addition, the proposed authentication method supports seamless encryption of code (and static data). Consequently, while providing the software users with assurance for authenticity of programs executing on their hardware, the proposed technique also protects the software manufacturers’ intellectual property through encryption. The performance analysis shows that, under mild assumptions, the presented technique introduces negligible overhead for even moderate cache sizes
Towards Designing Energy Efficient Symmetric Key Protocols
Energy consumption by various modern symmetric key encryption protocols (DES,
3-DES, AES and, Blowfish) is studied from an algorithmic perspective. The work
is directed towards redesigning or modifying the underlying algorithms for these
protocols to make them consume less energy than they currently do. This research
takes the approach of reducing energy consumption by parallelizing the
consecutive memory accesses of symmetric key encryption algorithms. To achieve
parallelization, an existing energy complexity model is applied to symmetric key
encryption algorithms. Inspired by the popular DDR3 architecture, the model assumes
that main memory is divided into multiple banks, each of which can store
multiple blocks. Each block in a bank can only be accessed from a cache of its
own, that can hold exactly one block. However all the caches from different banks
can be accessed simultaneously. In this research, experiments are conducted to
measure the difference in energy consumption by varying the level of parallelization,
i.e. variations of, number of banks that can be accessed in parallel. The
experimental results show that the higher the level of parallelism, smaller is the
energy consumption
Cryptographic Energy Costs are Assumable in Ad Hoc Networks
Performance of symmetric and asymmetric
cryptography algorithms in small devices is presented. Both temporal
and energy costs are measured and compared with the basic
functional costs of a device. We demonstrate that cryptographic
power costs are not a limiting factor of the autonomy of a device
and explain how processing delays can be conveniently managed
to minimize their impact
Performance-efficient cryptographic primitives in constrained devices
PhD ThesisResource-constrained devices are small, low-cost, usually fixed function and very limitedresource devices. They are constrained in terms of memory, computational capabilities,
communication bandwidth and power. In the last decade, we have seen widespread use of
these devices in health care, smart homes and cities, sensor networks, wearables, automotive
systems, and other fields. Consequently, there has been an increase in the research activities
in the security of these devices, especially in how to design and implement cryptography that
meets the devices’ extreme resource constraints.
Cryptographic primitives are low-level cryptographic algorithms used to construct security protocols that provide security, authenticity, and integrity of the messages. The building
blocks of the primitives, which are built heavily on mathematical theories, are computationally complex and demands considerable computing resources. As a result, most of these
primitives are either too large to fit on resource-constrained devices or highly inefficient
when implemented on them.
There have been many attempts to address this problem in the literature where cryptography engineers modify conventional primitives into lightweight versions or build new
lightweight primitives from scratch. Unfortunately, both solutions suffer from either reduced
security, low performance, or high implementation cost.
This thesis investigates the performance of the conventional cryptographic primitives and
explores the effect of their different building blocks and design choices on their performance.
It also studies the impact of the various implementations approaches and optimisation
techniques on their performance. Moreover, it investigates the limitations imposed by the
tight processing and storage capabilities in constrained devices in implementing cryptography.
Furthermore, it evaluates the performance of many newly designed lightweight cryptographic
primitives and investigates the resources required to run them with acceptable performance.
The thesis aims to provide an insight into the performance of the cryptographic primitives and
the resource needed to run them with acceptable performance. This will help in providing
solutions that balance performance, security, and resource requirements for these devices.The Institute of
Public Administration in Riyadh, and the Saudi Arabian Cultural Bureau in
Londo
- …