Pages that link to "Item:Q5426089"
From MaRDI portal
The following pages link to The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions (Q5426089):
Displaying 11 items.
- Constructing new APN functions from known ones (Q1011446) (← links)
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\) (Q1960215) (← links)
- Classification of quadratic APN functions with coefficients in \(\mathbb{F}_2\) for dimensions up to 9 (Q1994948) (← links)
- A further study of quadratic APN permutations in dimension nine (Q2135576) (← links)
- On relations between CCZ- and EA-equivalences (Q2179506) (← links)
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\) (Q2248639) (← links)
- On EA-equivalence of certain permutations to power mappings (Q2430411) (← links)
- Relative difference sets, graphs and inequivalence of functions between groups (Q3057074) (← links)
- О приближении дискретных функций линейными функциями (Q3381850) (← links)
- EA and CCZ Equivalence of Functions over GF(2 n ) (Q3519558) (← links)
- On Cryptographically Significant Mappings over GF(2 n ) (Q3519562) (← links)
