Higher-Order Masking Schemes for S-Boxes
From MaRDI portal
Publication:4899715
DOI10.1007/978-3-642-34047-5_21zbMath1312.94037OpenAlexW2124164831MaRDI QIDQ4899715
Michaël Quisquater, Claude Carlet, Matthieu Rivain, Emmanuel Prouff, Louis Goubin
Publication date: 8 January 2013
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34047-5_21
Related Items (20)
Secure wire shuffling in the probing model ⋮ Correlation power analysis and higher-order masking implementation of WAGE ⋮ Decomposition of permutations in a finite field ⋮ Algebraic Decomposition for Probing Security ⋮ Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters ⋮ Upper bounds on the multiplicative complexity of symmetric Boolean functions ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ Higher-Order Glitch Resistant Implementation of the PRESENT S-Box ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ On decompositions of permutation polynomials into quadratic and cubic power permutations ⋮ Unifying leakage models: from probing attacks to noisy leakage ⋮ Threshold Implementation in Software ⋮ Statistical properties of side-channel and fault injection attacks using coding theory ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version ⋮ Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Tornado: automatic generation of probing-secure masked bitsliced implementations ⋮ A number theoretic view on binary shift registers
Uses Software
This page was built for publication: Higher-Order Masking Schemes for S-Boxes
