On decompositions of permutation polynomials into quadratic and cubic power permutations

DOI10.1007/s12095-022-00600-8zbMath1516.94048WikidataQ114849078 ScholiaQ114849078MaRDI QIDQ6159437

George Petrides

Publication date: 20 June 2023

Published in: Cryptography and Communications (Search for Journal in Brave)

zbMATH Keywords

decompositionsside channel attackspower permutationscountermeasureshardware implementations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• A number theoretic view on binary shift registers
• Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials
• Decomposition of permutations in a finite field
• Polynomial Evaluation and Side Channel Analysis
• Algebraic Decomposition for Probing Security
• Threshold Implementations Against Side-Channel Attacks and Glitches
• On the divisors of $a^k + b^k$
• Higher-Order Masking Schemes for S-Boxes
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
• Permutations in a finite field

This page was built for publication: On decompositions of permutation polynomials into quadratic and cubic power permutations