Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

uKNIT: Breaking Round-alignment for Cipher Design : Featuring uKNIT-BC, an Ultra Low-Latency Block Cipher

Hu, Kai ; Khairallah, Mustafa LU ; Peyrin, Thomas and Tan, Quan Quan (2024) In Cryptology ePrint Archive 2024(1962).
Abstract
Automated cryptanalysis has seen a lot of attraction and success in the past decade, leading to new distinguishers or key-recovery attacks against various ciphers. We argue that the improved efficiency and usability of these new tools have been undervalued, especially for design processes. In this article, we break for the first time the classical iterative design paradigm for symmetric-key primitives, where constructions are built around the repetition of a round function. We propose instead a new design framework, so-called uKNIT, that allows a round-by-round optimization-led automated construction of the primitives and where each round can be entirely different from the others (the security/performance trade-off actually benefiting from... (More)
Automated cryptanalysis has seen a lot of attraction and success in the past decade, leading to new distinguishers or key-recovery attacks against various ciphers. We argue that the improved efficiency and usability of these new tools have been undervalued, especially for design processes. In this article, we break for the first time the classical iterative design paradigm for symmetric-key primitives, where constructions are built around the repetition of a round function. We propose instead a new design framework, so-called uKNIT, that allows a round-by-round optimization-led automated construction of the primitives and where each round can be entirely different from the others (the security/performance trade-off actually benefiting from this non-alignment).

This new design framework being non-trivial to instantiate, we further propose a method for SPN ciphers using a genetic algorithm and leveraging advances in automated cryptanalysis: given a pool of good cipher candidates on
rounds, our algorithm automatically generates and selects
-round candidates by evaluating their security and performance. We emphasize that our design pipeline is also the first to propose a fully automated design process, with completely integrated implementation and security analysis.

We finally exemplify our new design strategy on the important use-case of low-latency cryptography, by proposing the uKNIT-BC block cipher, together with a complete security analysis and benchmarks. Compared to the state-of-the-art in low-latency ciphers (PRINCEv2), uKNIT-BC improves on all crucial security and performance directions at the same time, reducing latency by 10%, while increasing resistance against classical differential/linear cryptanalysis by more than 10%. It also reduces area by 17% and energy consumption by 44% when fixing the latency of both ciphers. As a contribution of independent interest, we discovered a generalization of the Superposition-Tweakey (STK) construction for key schedules, unlocking its application to bit-oriented ciphers. (Less)
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Working paper/Preprint
publication status
published
subject
in
Cryptology ePrint Archive
volume
2024
issue
1962
publisher
IACR
language
English
LU publication?
yes
id
2c37d2b1-93d7-4b07-b3ce-8caf224a1638
alternative location
https://eprint.iacr.org/2024/1962
date added to LUP
2025-01-02 10:52:14
date last changed
2025-04-04 15:01:22
@misc{2c37d2b1-93d7-4b07-b3ce-8caf224a1638,
  abstract     = {{Automated cryptanalysis has seen a lot of attraction and success in the past decade, leading to new distinguishers or key-recovery attacks against various ciphers. We argue that the improved efficiency and usability of these new tools have been undervalued, especially for design processes. In this article, we break for the first time the classical iterative design paradigm for symmetric-key primitives, where constructions are built around the repetition of a round function. We propose instead a new design framework, so-called uKNIT, that allows a round-by-round optimization-led automated construction of the primitives and where each round can be entirely different from the others (the security/performance trade-off actually benefiting from this non-alignment).<br/><br/>This new design framework being non-trivial to instantiate, we further propose a method for SPN ciphers using a genetic algorithm and leveraging advances in automated cryptanalysis: given a pool of good cipher candidates on <br/> rounds, our algorithm automatically generates and selects <br/>-round candidates by evaluating their security and performance. We emphasize that our design pipeline is also the first to propose a fully automated design process, with completely integrated implementation and security analysis.<br/><br/>We finally exemplify our new design strategy on the important use-case of low-latency cryptography, by proposing the uKNIT-BC block cipher, together with a complete security analysis and benchmarks. Compared to the state-of-the-art in low-latency ciphers (PRINCEv2), uKNIT-BC improves on all crucial security and performance directions at the same time, reducing latency by 10%, while increasing resistance against classical differential/linear cryptanalysis by more than 10%. It also reduces area by 17% and energy consumption by 44% when fixing the latency of both ciphers. As a contribution of independent interest, we discovered a generalization of the Superposition-Tweakey (STK) construction for key schedules, unlocking its application to bit-oriented ciphers.}},
  author       = {{Hu, Kai and Khairallah, Mustafa and Peyrin, Thomas and Tan, Quan Quan}},
  language     = {{eng}},
  note         = {{Preprint}},
  number       = {{1962}},
  publisher    = {{IACR}},
  series       = {{Cryptology ePrint Archive}},
  title        = {{uKNIT: Breaking Round-alignment for Cipher Design : Featuring uKNIT-BC, an Ultra Low-Latency Block Cipher}},
  url          = {{https://eprint.iacr.org/2024/1962}},
  volume       = {{2024}},
  year         = {{2024}},
}