Differential uniformity and linearity of S-boxes by multiplicative complexity

Jeon, Yongjin; Baek, Seung Eun; Kim, Hangi; Kim, Giyoon; Kim, Jongsung

doi:10.1007/s12095-021-00547-2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields

Johann

2023

Cryptogr. Commun.

View full text Add to dashboard Cite

The multiplicative complexity of an S-box over a finite field is the minimum number of multiplications needed to implement the S-box as an arithmetic circuit. In this paper we fully characterize bijective S-boxes with multiplicative complexity 1 up to affine equivalence over any finite field. We show that under affine equivalence in odd characteristic there are two classes of bijective functions and in even characteristic there are three classes of bijective functions with multiplicative complexity 1. Moreover, in (Jeon et al., Cryptogr. Commun., 14(4), 849-874 (2022)) A-boxes where introduced to lower bound the differential uniformity of an S-box over $$\mathbb {F}_{2}^{n}$$ F 2 n via its multiplicative complexity. We generalize this concept to arbitrary finite fields. In particular, we show that the differential uniformity of a (n, m)-S-box over $$\mathbb {F}_{q}$$ F q is at least $$q^{n - l}$$ q n - l , where $$\lfloor \frac{n - 1}{2} \rfloor + l$$ ⌊ n - 1 2 ⌋ + l is the multiplicative complexity of the S-box.

show abstract