Decomposition of permutations in a finite field
From MaRDI portal
Publication:2632833
DOI10.1007/S12095-018-0317-2zbMATH Open1412.94196OpenAlexW2810911985WikidataQ129609169 ScholiaQ129609169MaRDI QIDQ2632833FDOQ2632833
Authors: Svetla Nikova, Ventzislav Nikov, Vincent Rijmen
Publication date: 15 May 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0317-2
Recommendations
Cites Work
- Title not available (Why is that?)
- On the classification of APN functions up to dimension five
- On Almost Perfect Nonlinear Permutations
- Permutations in a finite field
- Algebraic Decomposition for Probing Security
- Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
- Threshold implementations of small S-boxes
- Title not available (Why is that?)
- On a theorem of Carlitz
- Side-channel resistant crypto for less than 2,300 GE
- Higher-Order Masking Schemes for S-Boxes
- On the Carlitz rank of permutation polynomials
- Enabling 3-Share Threshold Implementations for all 4-Bit S-Boxes
- Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
- A Note on Permutations in an Arbitrary Field
Cited In (6)
- Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials
- Protecting Triple-DES Against DPA
- Permutation polynomials and factorization
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- Spin me right round rotational symmetry for FPGA-specific AES: extended version
- A decomposition of \(\text{Fl}(n)^d\) indexed by permutation arrays
This page was built for publication: Decomposition of permutations in a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632833)