Download PDF (external access)

SAC 2016, Date: 2016/08/10 - 2016/08/12, Location: St. John's, NL, Canada

Publication date: 2016-01-01
Volume: 10532 LNCS Pages: 161 - 179
ISSN: 978-3-319-69452-8
Publisher: Springer-Verlag

Lecture Notes in Computer Science

Author:

Picek, Stjepan
Yang, Bohan ; Rozic, Vladimir ; Mentens, Nele

Abstract:

© 2017, Springer International Publishing AG. With the emergence of the Internet of Things and lightweight cryptography, one can observe a gradual shift of interest in the design of block ciphers. Naturally, security is still of paramount importance, but one is willing to trade a part of that security in order to obtain higher speed and/or smaller implementation area. Accordingly, a common metric in many cipher proposals has been the gate count for realizing the cipher in hardware. On the other side, it is also important, especially for battery powered devices, to have a small energy consumption. That is why we can observe the following shift of research focus: from the analysis of the energy consumption of existing ciphers and their building blocks to the design of new ciphers and building blocks, specifically for low energy. Existing research results focusing on the energy consumption of symmetric ciphers, suggest that the S-box is the most expensive part in the majority of lightweight implementations. If we only consider purely combinatorial S-boxes, we can focus on reducing the power consumption of the S-box in order to minimize the energy consumption of the overall cipher. In this paper, we propose several methods to obtain 4 × 4 and 5 × 5 S-boxes that are either power or area efficient. Our results show that heuristics should be considered as a viable choice for the generation of S-boxes with good implementation properties.