Higher-Order Side Channel Security and Mask Refreshing

DOI10.1007/978-3-662-43933-3_21zbMath1321.94052MaRDI QIDQ2946888

Emmanuel Prouff, Jean-Sébastien Coron, Matthieu Rivain, Thomas Roche

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_21

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Detecting Flawed Masking Schemes with Leakage Detection Tests, How Fast Can Higher-Order Masking Be in Software?, Unconditionally secure computation against low-complexity leakage, Correction to: ``Unconditionally secure computation against low-complexity leakage, \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption, Dynamic random probing expansion with quasi linear asymptotic complexity, Correlation power analysis and higher-order masking implementation of WAGE, White-box cryptography: don't forget about grey-box attacks, Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version, Tornado: automatic generation of probing-secure masked bitsliced implementations, On the power of expansion: more efficient constructions in the random probing model, Random probing security: verification, composition, expansion and new constructions, Towards tight random probing security, Cryptanalysis of masked ciphers: a not so random idea, Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON, Polynomial Evaluation and Side Channel Analysis, Reducing Randomness Complexity of Mask Refreshing Algorithm, Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison, Vectorizing Higher-Order Masking, Compositional Synthesis of Leakage Resilient Programs

Cites Work