Two Notions of Differential Equivalence on Sboxes - Archive ouverte HAL Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2019

Two Notions of Differential Equivalence on Sboxes

(1, 2) , (1) , (3) , (2)


In this work, we discuss two notions of differential equivalence on Sboxes. First, we introduce the notion of DDT-equivalence which applies to vectorial Boolean functions that share the same difference distribution table (DDT). Next, we compare this notion to what we call the $γ$-equivalence, applying to vectorial Boolean functions whose DDTs have the same support. We discuss the relation between these two equivalence notions, demonstrate that the number of DDT- or $γ$--equivalent functions is invariant under EA- and CCZ-equivalence and provide an algorithm for computing the DDT-equivalence and the $γ$-equivalence classes of a given function. We study the sizes of these classes for some families of Sboxes. Finally, we prove a result that shows that the rows of the DDT of an APN permutation are pairwise distinct.
Fichier principal
Vignette du fichier
longpaper.pdf (627.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01944565 , version 1 (04-12-2018)



Christina Boura, Anne Canteaut, Jérémy Jean, Valentin Suder. Two Notions of Differential Equivalence on Sboxes. Designs, Codes and Cryptography, In press, 87 (2-3), pp.185-202. ⟨10.1007/s10623-018-0496-z⟩. ⟨hal-01944565⟩
61 View
170 Download



Gmail Facebook Twitter LinkedIn More