Masking Gaussian elimination at arbitrary order with application to multivariate-and code-based PQC

DOI10.1007/978-3-031-88661-4_11MaRDI QIDQ6908353zbMATH OpenFDO

Authors Quinten Norga, Suparna Kundu, Uttam Kumar Ojha, Angshuman Karmakar, Ingrid Verbauwhede

Publication date 31 October 2025

Full work available at URL https://doi.org/10.1007/978-3-031-88661-4_11

zbMATH Keywords

digital signaturesGaussian eliminationmaskingPQCUOV

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• Advances in Cryptology - CRYPTO 2003
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• High-order conversion from Boolean to arithmetic masking
• Higher-order masked Saber
• IPRainbow
• Masking the GLP lattice-based signature scheme at any order
• Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
• Secure conversion between Boolean and arithmetic masking of any order
• Secure wire shuffling in the probing model
• Towards sound approaches to counteract power-analysis attacks
• VDOO: a short, fast, post-quantum multivariate digital signature scheme

This page was built for publication: Masking Gaussian elimination at arbitrary order with application to multivariate-and code-based PQC

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