On the algebraic degree of iterated power functions
From MaRDI portal
Publication:2692966
DOI10.1007/s10623-022-01136-xOpenAlexW4307649440MaRDI QIDQ2692966
Anne Canteaut, Clémence Bouvier, Léo Perrin
Publication date: 17 March 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01136-x
finite fieldblock ciphercryptanalysisalgebraic degreesymmetric cryptographyMiMChigher order differential attack
Related Items (3)
Coefficient grouping: breaking Chaghri and more ⋮ On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC ⋮ Coefficient grouping for complex affine layers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of permutation polynomials of a given degree over a finite field
- Enumerating permutation polynomials over finite fields by degree
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- On the Influence of the Algebraic Degree of $F^{-1}$ on the Algebraic Degree of $G \circ F$
- The degrees of permutation polynomials over finite fields
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: On the algebraic degree of iterated power functions