G-perfect nonlinear functions
From MaRDI portal
Publication:1008966
DOI10.1007/s10623-007-9137-7zbMath1179.94060MaRDI QIDQ1008966
James A. Davis, Laurent Poinsot
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9137-7
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
Related Items
On automorphism groups of divisible designs acting regularly on the set of point classes, A new characterization of group action-based perfect nonlinearity, Fourier transforms and bent functions on finite groups, A new framework for identifying absolute maximum nonlinear functions, Fourier transforms on finite group actions and bent functions, Nonlinear functions and difference sets on group actions, Characterizations and constructions of plateaued functions on finite abelian groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- A family of skew Hadamard difference sets
- Construction of relative difference sets in \(p\)-groups
- On ``bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Nonlinear functions in abelian groups and relative difference sets.
- Highly nonlinear mappings
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- A new APN function which is not equivalent to a power mapping
- Perfect nonlinear S-boxes
- Almost difference sets and their sequences with optimal autocorrelation
- On Orthogonal Matrices
- On Almost Perfect Nonlinear Permutations
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Progress in Cryptology - INDOCRYPT 2004
