Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials

DOI10.1007/s12095-021-00512-zzbMath1485.94114OpenAlexW3182228232MaRDI QIDQ2121013

Eda Tekin, Kamil Otal

Publication date: 1 April 2022

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

Full work available at URL: https://doi.org/10.1007/s12095-021-00512-z

zbMATH Keywords

Boolean functionsS-boxespower permutations

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (94D10)

Related Items (1)

On decompositions of permutation polynomials into quadratic and cubic power permutations

Cites Work

• Side-channel resistant crypto for less than 2,300 GE
• Threshold implementations of small S-boxes
• Decomposition of permutations in a finite field
• Enabling 3-Share Threshold Implementations for all 4-Bit S-Boxes
• Algebraic Decomposition for Probing Security
• Permutations in a finite field
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials