Optimal First-Order Masking with Linear and Non-linear Bijections

DOI10.1007/978-3-642-31410-0_22zbMATH Open1291.94123OpenAlexW2178161958MaRDI QIDQ2900634FDOQ2900634

Authors: Houssem Maghrebi, Claude Carlet, Sylvain Guilley, Jean-Luc Danger 

Publication date: 23 July 2012

Published in: Progress in Cryptology - AFRICACRYPT 2012 (Search for Journal in Brave)

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

Recommendations

• Reducing the number of non-linear multiplications in masking schemes
• Vectorizing higher-order masking
• Inner product masking revisited
• Fast first-order masked NTTRU
• Generalized invariant-unbiased masking and estimation of informational processes with multistructural noise
• Verified Proofs of Higher-Order Masking
• Theoretical and applied aspects of the mathematical apparatus of permutation-masking transformations

zbMATH Keywords

linear codesnonlinear codesfirst-order masking countermeasure (CM)high-order correlation power analysis (HO-CPA)zero-offset HO-CPA

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Statistical properties of side-channel and fault injection attacks using coding theory
• Leakage squeezing of order two
• Leakage squeezing: optimal implementation and security evaluation

This page was built for publication: Optimal First-Order Masking with Linear and Non-linear Bijections

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