Removing the field size loss from Duc et al.'s conjectured bound for masked encodings

DOI10.1007/978-3-031-29497-6_5zbMath1526.94022MaRDI QIDQ6088705

No author found.

Publication date: 16 November 2023

Published in: Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)

zbMATH Keywords

side-channel attackBoolean maskingarithmetic masking modulo a power of two

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model

Cites Work

• Unnamed Item
• Breaking cryptographic implementations using deep learning techniques
• Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
• A systematic appraisal of side channel evaluation strategies
• Unifying leakage models on a Rényi day
• Generalization of Mrs. Gerber's lemma
• Optimal Amplification of Noisy Leakages
• Soft Analytical Side-Channel Attacks
• Making Masking Security Proofs Concrete
• Noisy Leakage Revisited
• The Entropy Power Inequality and Mrs. Gerber's Lemma for Groups of Order <inline-formula> <tex-math notation="TeX">${2^{n}}$ </tex-math></inline-formula>
• Adaptive Chosen-Message Side-Channel Attacks
• A theorem on the entropy of certain binary sequences and applications--I
• Masking against Side-Channel Attacks: A Formal Security Proof
• Towards sound approaches to counteract power-analysis attacks
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Advances in Cryptology - CRYPTO 2003
• Elements of Information Theory
• Inequalities: theory of majorization and its applications

This page was built for publication: Removing the field size loss from Duc et al.'s conjectured bound for masked encodings