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

DOI10.1007/S12095-023-00661-3zbMATH Open1539.94028MaRDI QIDQ6542664

Matthias Johann Steiner

Publication date: 22 May 2024

Published in: Cryptography and Communications (Search for Journal in Brave)

zbMATH Keywords

arithmetic circuitdifferential uniformitymultiplicative complexityS-boxM-box

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06)

Cites Work

• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• The design of Rijndael. The Advanced Encryption Standard (AES)
• Multiplicative complexity of vector valued Boolean functions
• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• On a generalization of substitution-permutation networks: the HADES design strategy
• Differential uniformity and linearity of S-boxes by multiplicative complexity
• Feistel structures for MPC, and more
• Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
• An algebraic attack on ciphers with low-degree round functions: application to full MiMC
• Ciphers for MPC and FHE
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• Permutation polynomials in several variables over finite fields

This page was built for publication: A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542664)