Mask compression: high-order masking on memory-constrained devices

DOI10.1007/978-3-031-53368-6_4MaRDI QIDQ6620034zbMATH OpenFDO

Authors Markku-Juhani O. Saarinen, Mélissa Rossi

Publication date 16 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-53368-6_4

zbMATH Keywords

mask compressionpost-quantum cryptographyraccoon signature schemeside-channel security

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Channel models (including quantum) in information and communication theory (94A40) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• How fast can higher-order masking be in software?
• Higher-order side channel security and mask refreshing
• Secret can be public: low-memory AEAD mode for high-order masking
• Revisiting a masked lookup-table compression scheme
• Higher-order masking schemes for S-boxes

Cites work

• Advances in cryptology - CRYPTO '99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15--19, 1999. Proceedings
• Advances in Cryptology - CRYPTO 2003
• Higher order masking of look-up tables
• Higher-order side channel security and mask refreshing
• scientific article; zbMATH DE number 1857508 (Why is no real title available?)
• Introduction to Modern Cryptography
• Leakage assessment methodology. A clear roadmap for side-channel evaluations
• Making Masking Security Proofs Concrete
• Masking against Side-Channel Attacks: A Formal Security Proof
• Masking Dilithium. Efficient implementation and side-channel evaluation
• Provably secure higher-order masking of AES
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Unifying leakage models: from probing attacks to noisy leakage

This page was built for publication: Mask compression: high-order masking on memory-constrained devices

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