5,740 research outputs found
Recommended from our members
LEE: Light‐Weight Energy‐Efficient encryption algorithm for sensor networks
Data confidentiality in wireless sensor networks is mainly achieved by RC5 and Skipjack encryption algorithms. However, both algorithms have their weaknesses, for example RC5 supports variable-bit rotations, which are computationally expensive operations and Skipjack uses a key length of 80-bits, which is subject to brute force attack. In this paper we introduce a light-weight energy- fficient encryption-algorithm (LEE) for tiny embedded devices, such as sensor network nodes. We present experimental results of LEE under real sensor nodes operating in TinyOS. We also discuss the secrecy of our algorithm by presenting a security analysis of various tests and cryptanalytic attacks
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
Benchmarking Block Ciphers for Wireless Sensor Networks
Choosing the most storage- and energy-efficient block cipher specifically for wireless sensor networks (WSNs) is not as straightforward as it seems. To our knowledge so far, there is no systematic evaluation framework for the purpose. We have identified the candidates of block ciphers suitable for WSNs based on existing literature. For evaluating and assessing these candidates, we have devised a systematic framework that not only considers the security properties but also the storage- and energy-efficency of the candidates. Finally, based on the evaluation results, we have selected the suitable ciphers for WSNs, namely Rijndael for high security and energy efficiency requirements; and MISTY1 for good storage and energy efficiency
Linear Choosability of Sparse Graphs
We study the linear list chromatic number, denoted \lcl(G), of sparse
graphs. The maximum average degree of a graph , denoted \mad(G), is the
maximum of the average degrees of all subgraphs of . It is clear that any
graph with maximum degree satisfies \lcl(G)\ge
\ceil{\Delta(G)/2}+1. In this paper, we prove the following results: (1) if
\mad(G)<12/5 and , then \lcl(G)=\ceil{\Delta(G)/2}+1, and
we give an infinite family of examples to show that this result is best
possible; (2) if \mad(G)<3 and , then
\lcl(G)\le\ceil{\Delta(G)/2}+2, and we give an infinite family of examples to
show that the bound on \mad(G) cannot be increased in general; (3) if is
planar and has girth at least 5, then \lcl(G)\le\ceil{\Delta(G)/2}+4.Comment: 12 pages, 2 figure
- …