Decomposition of Dillon's APN permutation with efficient hardware implementation

DOI10.1007/978-3-031-22944-2_16MaRDI QIDQ6169017

José Luis Imaña, Nikolay Kaleyski, Lilya Budaghyan

Publication date: 10 August 2023

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

zbMATH Keywords

finite fieldBoolean functionsblock cipherhardware implementationalmost perfect nonlinear (APN)\textit{S-box}

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• On the EA-classes of known APN functions in small dimensions
• A note on APN permutations in even dimension
• Affinity of permutations of \(\mathbb F_{2}^{n}\)
• Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
• Fides: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware
• Parallel multipliers based on special irreducible pentanomials
• Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
• A New Family of APN Quadrinomials

This page was built for publication: Decomposition of Dillon's APN permutation with efficient hardware implementation