Higher-Order Side Channel Security and Mask Refreshing

DOI10.1007/978-3-662-43933-3_21zbMath1321.94052OpenAlexW1425736675MaRDI 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

Cryptography (94A60)

Related Items

Towards tight random probing security, Correlation power analysis and higher-order masking implementation of WAGE, Handcrafting: improving automated masking in hardware with manual optimizations, \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption, Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model, Dynamic random probing expansion with quasi linear asymptotic complexity, Unifying freedom and separation for tight probing-secure composition, Cryptanalysis of masked ciphers: a not so random idea, 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, Detecting Flawed Masking Schemes with Leakage Detection Tests, How Fast Can Higher-Order Masking Be in Software?, 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, 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, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• A Fast and Provably Secure Higher-Order Masking of AES S-Box
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• On Compressible Pairings and Their Computation
• Provably Secure Higher-Order Masking of AES
• Aspects of Pairing Inversion
• A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
• Higher-Order Masking Schemes for S-Boxes
• Statistical Analysis of Second Order Differential Power Analysis
• Optimal Pairings
• Revisiting Higher-Order DPA Attacks:
• Approach to Pairing Inversions Without Solving Miller Inversion
• Advances in Cryptology - CRYPTO 2003
• On Pairing Inversion Problems