Masking with randomized look up tables. Towards preventing side-channel attacks of all orders

DOI10.1007/978-3-642-28368-0_19MaRDI QIDQ2889770zbMATH OpenOpenAlexWikidataFDO

Authors Nicolas Veyrat-Charvillon, François-Xavier Standaert, Christophe Petit

Publication date 8 June 2012

Published in Cryptography and Security: From Theory to Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28368-0_19

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Higher order masking of look-up tables
• Masking tables -- an underestimated security risk
• Masking against Side-Channel Attacks: A Formal Security Proof
• Higher-order masking schemes for S-boxes
• Selected Areas in Cryptography

Cited in

(11)

• Not so difficult in the end: breaking the lookup table-based affine masking scheme
• Time-memory trade-offs for side-channel resistant implementations of block ciphers
• Masking tables -- an underestimated security risk
• Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
• Block ciphers that are easier to mask: how far can we go?
• Selected Areas in Cryptography
• Secret can be public: low-memory AEAD mode for high-order masking
• Higher order masking of look-up tables
• Revisiting a masked lookup-table compression scheme
• Cryptanalysis of masked ciphers: a not so random idea
• Affine Masking against Higher-Order Side Channel Analysis

This page was built for publication: Masking with randomized look up tables. Towards preventing side-channel attacks of all orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889770)