Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Perfect Trees: Designing Energy-Optimal Symmetric Encryption Primitives
 
research article

Perfect Trees: Designing Energy-Optimal Symmetric Encryption Primitives

Caforio, Andrea  
•
Banik, Subhadeep  
•
Todo, Yosuke
Show more
January 1, 2021
Iacr Transactions On Symmetric Cryptology

Energy efficiency is critical in battery-driven devices, and designing energy-optimal symmetric-key ciphers is one of the goals for the use of ciphers in such environments. In the paper by Banik et al. (IACR ToSC 2018), stream ciphers were identified as ideal candidates for low-energy solutions. One of the main conclusions of this paper was that Trivium, when implemented in an unrolled fashion, was by far the most energy-efficient way of encrypting larger quantity of data. In fact, it was shown that as soon as the number of databits to be encrypted exceeded 320 bits, Trivium consumed the least amount of energy on STM 90 nm ASIC circuits and outperformed the Midori family of block ciphers even in the least energy hungry ECB mode (Midori was designed specifically for energy efficiency).

In this work, we devise the first heuristic energy model in the realm of stream ciphers that links the underlying algebraic topology of the state update function to the consumptive behaviour. The model is then used to derive a metric that exhibits a heavy negative correlation with the energy consumption of a broad range of stream cipher architectures, i.e., the families of Trivium-like, Grain-like and Subterranean-like constructions. We demonstrate that this correlation is especially pronounced for Trivium-like ciphers which leads us to establish a link between the energy consumption and the security guarantees that makes it possible to find several alternative energy-optimal versions of Trivium that meet the requirements but consume less energy. We present two such designs Trivium-LE(F) and Trivium-LE(S) that consume around 15% and 25% less energy respectively making them the to date most energy-efficient encryption primitives. They inherit the same security level as Trivium, i.e., 80-bit security. We further present Triad-LE as an energy-efficient variant satisfying a higher security level. The simplicity and wide applicability of our model has direct consequences for the conception of future hardware-targeted stream ciphers as for the first time it is possible to optimize for energy during the design phase. Moreover, we extend the reach of our model beyond plain encryption primitives and propose a novel energy-efficient message authentication code Trivium-LE-MAC.

  • Details
  • Metrics
Type
research article
DOI
10.46586/tosc.v2021.i4.36-73
Web of Science ID

WOS:000728587400002

Author(s)
Caforio, Andrea  
Banik, Subhadeep  
Todo, Yosuke
Meier, Willi
Isobe, Takanori
Liu, Fukang
Zhang, Bin
Date Issued

2021-01-01

Publisher

RUHR-UNIV BOCHUM, HORST GORTZ INST IT-SICHERHEIT

Published in
Iacr Transactions On Symmetric Cryptology
Volume

2021

Issue

4

Start page

36

End page

73

Subjects

Computer Science, Software Engineering

•

Computer Science, Theory & Methods

•

Computer Science

•

lightweight cryptography

•

stream cipher

•

hardware

•

low energy encryption

•

trivium

•

grain

•

subterranean

•

cube attacks

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LASEC  
Available on Infoscience
December 18, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/183969
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés