Higher Order Masking of Look-Up Tables
From MaRDI portal
Publication:5418710
DOI10.1007/978-3-642-55220-5_25zbMath1326.94082OpenAlexW1847989447MaRDI QIDQ5418710
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_25
Related Items (22)
Secure wire shuffling in the probing model ⋮ Correlation power analysis and higher-order masking implementation of WAGE ⋮ Consolidating Masking Schemes ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Threshold implementations of small S-boxes ⋮ Provable secure software masking in the real-world ⋮ Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations ⋮ Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model ⋮ Time-Memory Trade-Offs for Side-Channel Resistant Implementations of Block Ciphers ⋮ Detecting Flawed Masking Schemes with Leakage Detection Tests ⋮ There Is Wisdom in Harnessing the Strengths of Your Enemy: Customized Encoding to Thwart Side-Channel Attacks ⋮ Statistical properties of side-channel and fault injection attacks using coding theory ⋮ Multivariate high-order attacks of shuffled tables recomputation ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Codes for Side-Channel Attacks and Protections ⋮ Masking the GLP lattice-based signature scheme at any order ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ On the power of expansion: more efficient constructions in the random probing model ⋮ A VLSI implementation of an SM4 algorithm resistant to power analysis
This page was built for publication: Higher Order Masking of Look-Up Tables
