On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy

Lorenzo Grassi*, Reinhard Lüftenegger, Christian Rechberger, Dragos Rotaru, Markus Schofnegger

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem Konferenzband

Abstract

Keyed and unkeyed cryptographic permutations often iterate simple round functions. Substitution-permutation networks (SPNs) are an approach that is popular since the mid 1990s. One of the new directions in the design of these round functions is to reduce the substitution (S-Box) layer from a full one to a partial one, uniformly distributed over all the rounds. LowMC and Zorro are examples of this approach.

A relevant freedom in the design space is to allow for a highly non-uniform distribution of S-Boxes. However, choosing rounds that are so different from each other is very rarely done, as it makes security analysis and implementation much harder.

We develop the design strategy Hades and an analysis framework for it, which despite this increased complexity allows for security arguments against many classes of attacks, similar to earlier simpler SPNs. The framework builds upon the wide trail design strategy, and it additionally allows for security arguments against algebraic attacks, which are much more of a concern when algebraically simple S-Boxes are used.

Subsequently, this is put into practice by concrete instances and benchmarks for a use case that generally benefits from a smaller number of S-Boxes and showcases the diversity of design options we support: A candidate cipher natively working with objects in GF(p), for securing data transfers with distributed databases using secure multiparty computation (MPC). Compared to the currently fastest design MiMC, we observe significant improvements in online bandwidth requirements and throughput with a simultaneous reduction of preprocessing effort, while having a comparable online latency.
Originalspracheenglisch
TitelAdvances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
UntertitelLecture Notes in Computer Science
Redakteure/-innenAnne Canteaut, Yuval Ishai
Herausgeber (Verlag)Springer, Cham
Seiten674-704
Seitenumfang31
Band12106
ISBN (elektronisch)978-3-030-45724-2
ISBN (Print)978-3-030-45723-5
DOIs
PublikationsstatusVeröffentlicht - 1 Mai 2020
VeranstaltungEurocrypt 2020 -
Dauer: 11 Mai 202015 Mai 2020
https://eurocrypt.iacr.org/2020/

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band12106 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

KonferenzEurocrypt 2020
Zeitraum11/05/2015/05/20
Internetadresse

ASJC Scopus subject areas

  • !!Theoretical Computer Science
  • !!Computer Science(all)

Fingerprint

Untersuchen Sie die Forschungsthemen von „On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren