A Fast and Provably Secure Higher-Order Masking of AES S-Box

DOI10.1007/978-3-642-23951-9_7zbMath1321.94068OpenAlexW40446008MaRDI QIDQ3172967

Seokhie Hong, Jong In Lim, Heeseok Kim

Publication date: 7 October 2011

Published in: Cryptographic Hardware and Embedded Systems – CHES 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23951-9_7

zbMATH Keywords

AESside channel attackdifferential power analysishigher-order maskinghigher-order DPA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Algebraic Decomposition for Probing Security ⋮ Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ Masking Tables—An Underestimated Security Risk ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Two improved multiple-differential collision attacks ⋮ Vectorizing Higher-Order Masking ⋮ Statistical properties of side-channel and fault injection attacks using coding theory ⋮ How Fast Can Higher-Order Masking Be in Software? ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON ⋮ Polynomial Evaluation and Side Channel Analysis

This page was built for publication: A Fast and Provably Secure Higher-Order Masking of AES S-Box