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

DOI10.1007/978-3-642-28368-0_19zbMATH Open1300.94094OpenAlexW145209237WikidataQ62047262 ScholiaQ62047262MaRDI QIDQ2889770FDOQ2889770

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (9)

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

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)