Exponential sums in linear cryptanalysis
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1759276 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$
- A geometric approach to linear cryptanalysis
- Block cipher invariants as eigenvectors of correlation matrices
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Cohomologie étale. Seminaire de géométrie algébrique du Bois-Marie SGA 4 1/2 par P. Deligne, avec la collaboration de J. F. Boutot, A. Grothendieck, L. Illusie et J. L. Verdier
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Exponential sums and Newton polyhedra: cohomology and estimates
- If a generalised butterfly is APN then it operates on 6 bits
- La conjecture de Weil. I
- La conjecture de Weil. II
- Linear Cryptanalysis of Non Binary Ciphers
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode
- On Some Exponential Sums
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- Provable security against a differential attack
- Purity of exponential sums on $\mathbb{A}^n$
- Singular Points of Complex Hypersurfaces. (AM-61)
- The Wide Trail Design Strategy
- Weights of exponential sums, intersection cohomology, and Newton polyhedra
This page was built for publication: Exponential sums in linear cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847550)