Decomposition of permutations in a finite field
From MaRDI portal
Publication:2632833
Recommendations
Cites work
- scientific article; zbMATH DE number 2081068 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- A Note on Permutations in an Arbitrary Field
- Algebraic decomposition for probing security
- 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
- Higher-order masking schemes for S-boxes
- On Almost Perfect Nonlinear Permutations
- On a theorem of Carlitz
- On the Carlitz rank of permutation polynomials
- On the classification of APN functions up to dimension five
- Permutations in a finite field
- Side-channel resistant crypto for less than 2,300 GE
- Threshold implementations of all \(3 \times 3\) and \(4 \times 4\) S-boxes
- Threshold implementations of small S-boxes
Cited in
(6)- Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials
- 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
- Protecting triple-DES against DPA. A practical application of domain-oriented masking
- 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)