Partially APN functions with APN-like polynomial representations
From MaRDI portal
Publication:2182079
DOI10.1007/s10623-020-00739-6zbMath1434.94118OpenAlexW3007668722MaRDI QIDQ2182079
Lilya Budaghyan, Nikolay Kaleyski, Pantelimon Stănică, Constanza Riera
Publication date: 21 May 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11250/2756790
Cryptography (94A60) Topological lattices (06B30) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items (2)
On the behavior of some APN permutations under swapping points ⋮ An infinite family of 0-APN monomials with two parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Reversed Dickson polynomials over finite fields
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Partially APN Boolean functions and classes of functions that are not APN infinitely often
- Collineation Groups of Non-Desarguesian Planes, I: The Hall Veblen-Wedderburn Systems
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- Construction and Analysis of Cryptographic Functions
- On Upper Bounds for Algebraic Degrees of APN Functions
- On the solution of algebraic equations over finite fields
This page was built for publication: Partially APN functions with APN-like polynomial representations