Towards Green Cryptography: A Comparison of Lightweight Ciphers from the Energy Viewpoint

Kerckhof, Stéphanie; Durvaux, François; Hocquet, Cédric; Bol, David; Standaert, François‐Xavier

doi:10.1007/978-3-642-33027-8_23

Cited by 67 publications

(48 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While our methodology would be perfectly applicable to other choices of metrics, we believe they are an interesting starting point to capture the efficiency of our different implementations. In particular for the hardware cases, such metrics are less dependent on the serial vs. parallel nature of the target architectures (see [26], Section 2). 4.…”

Section: Methodology and Limitationsmentioning

confidence: 99%

Masking and leakage-resilient primitives: One, the other(s) or both?

2014

Self Cite

View full text Add to dashboard Cite

Abstract. Securing cryptographic implementations against side-channel attacks is one of the most important challenges in modern cryptography. Many countermeasures have been introduced for this purpose, and analyzed in specialized security models. Formal solutions have also been proposed to extend the guarantees of provable security to physically observable devices. Masking and leakage-resilient cryptography are probably the most investigated and best understood representatives of these two approaches. Unfortunately, claims whether one, the other or their combination provides better security at lower cost remained vague so far. In this paper, we provide the first comprehensive treatment of this important problem. For this purpose, we analyze whether cryptographic implementations can be security-bounded, in the sense that the time complexity of the best side-channel attack is lower-bounded, independent of the number of measurements performed. Doing so, we first put forward a significant difference between stateful primitives such as leakage-resilient PRGs (that easily ensure bounded security), and stateless ones such as leakage-resilient PRFs (that hardly do). We then show that in practice, leakage-resilience alone provides the best security vs. performance tradeoff when bounded security is achievable, while masking alone is the solution of choice otherwise. That is, we highlight that one (x)or the other approach should be privileged, which contradicts the usual intuition that physical security is best obtained by combining countermeasures.Besides, our experimental results underline that despite defined in exactly the same way, the bounded leakage requirement in leakage-resilient PRGs and PRFs imply significantly different challenges for hardware designers. Namely, such a bounded leakage is much harder to guarantee for stateless primitives (like PRFs) than for statefull ones (like PRGs). As a result, constructions of leakage-resilient PRGs and PRFs proven under the same bounded leakage assumption, and instantiated with the same AES implementation, may lead to different practical security levels.

show abstract

Section: Methodology and Limitationsmentioning

confidence: 99%

Masking and leakage-resilient primitives: One, the other(s) or both?

2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [4] and [5], the authors have proposed benchmarking of LWCs targeting WSNs. Targeting usage of LWCs in automotive industries [6] surveyed the same in terms of hardware area (gate equivalent), energy consumption and latency while in [7] analyzes various LWCs with respect to energy as metric. Using ATMEL AVR ATtiny45 8-bit microcontroller as common platform performance of different LWCs have been evaluated w.r.t RAM usage, code size and cycle count for smart devices in [8].…”

Section: Related Workmentioning

confidence: 99%

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

et al. 2017

View full text Add to dashboard Cite

In March 2017, NIST (National Institute of Standards and Technology) has announced to create a portfolio of lightweight algorithms through an open process. The report emphasizes that with emerging applications like automotive systems, sensor networks, healthcare, distributed control systems, the Internet of Things (IoT), cyber-physical systems, and the smart grid, a detailed evaluation of the so called light-weight ciphers helps to recommend algorithms in the context of profiles, which describe physical, performance, and security characteristics. In recent years, a number of lightweight block ciphers have been proposed for encryption/decryption of data which makes such choices complex. Each such cipher offers a unique combination of resistance to classical cryptanalysis and resource-efficient implementations. At the same time, these implementations must be protected against implementation-based attacks such as side-channel analysis. In this paper, we present a holistic comparison study of four lightweight block ciphers, PRESENT, SIMON, SPECK, and KHUDRA, along with the more traditional Advanced Encryption Standard (AES). We present a uniform comparison of the performance and efficiency of these block ciphers in terms of area and power consumption, on ASIC and FPGA-based platforms. Additionally, we also compare the amenability to side-channel secure implementations for these ciphers on ASIC-based platforms. Our study is expected to help designers make suitable choices when securing a given application, across a wide range of implementation platforms.

show abstract

“…Implementation on sensor nodes is very hardware-dependent; optimization can be done for certain functions depending on the capacities and the design of the hardware. Thus comparing different implementations on different motes is not really conclusive, as is shown in [30][31][32][33]. The same applies for comparison by simulation, which is even less conclusive because simulation does not give an idea about how complex the operations are.…”

Section: Evaluationsmentioning

confidence: 99%

Evaluation of Secure Multi-Hop Node Authentication and Key Establishment Mechanisms for Wireless Sensor Networks

Mansour

Chalhoub

Lafourcade

2014

JSAN

View full text Add to dashboard Cite

Designing secure authentication mechanisms in wireless sensor networks in order to associate a node to a secure network is not an easy task due to the limitations of this type of networks. In this paper, we propose different multi-hop node authentication protocols for wireless sensor networks. For each protocol, we provide a formal proof to verify the security of our proposals using Scyther, which is an automatic cryptographic protocols verification tool. We also provide implementation results in terms of execution time consumption obtained by real measurements on TelosB motes. These protocols offer different security mechanisms depending on the design of the protocol itself. Moreover, we evaluate the overhead of protection of each solution by studying the effect on execution time overhead of each protocol. Finally, we propose a mechanism to detect possible attack based on our evaluation results.

show abstract

Towards Green Cryptography: A Comparison of Lightweight Ciphers from the Energy Viewpoint

Cited by 67 publications

References 18 publications

Masking and leakage-resilient primitives: One, the other(s) or both?

Masking and leakage-resilient primitives: One, the other(s) or both?

An Evaluation of Lightweight Block Ciphers for Resource-Constrained Applications: Area, Performance, and Security

Evaluation of Secure Multi-Hop Node Authentication and Key Establishment Mechanisms for Wireless Sensor Networks

Contact Info

Product

Resources

About