Non-complete set coverings for higher order threshold implementations

DOI10.1007/S10623-026-01806-0MaRDI QIDQ7254970zbMATH OpenFDO

Authors Oriol Farràs, Óscar Fidalgo, Carlos Andres Lara-Nino

Publication date 29 May 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-026-01806-0

zbMATH Keywords

high-order maskingnon-complete set coveringsside channel attacksthreshold implementations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Combinatorics in computer science (68R05) Cryptography (94A60)

Cites work

• An optimal universal construction for the threshold implementation of bijective S-boxes
• Boolean functions for cryptography and coding theory
• Consolidating masking schemes
• From substitution box to threshold
• Higher-Order Threshold Implementations
• scientific article; zbMATH DE number 1504808 (Why is no real title available?)
• scientific article; zbMATH DE number 1759297 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Power Analysis Attacks
• Secure multiparty computation and secret sharing
• Threshold Implementations Against Side-Channel Attacks and Glitches
• Topics in Cryptology – CT-RSA 2005
• Towards sound approaches to counteract power-analysis attacks

This page was built for publication: Non-complete set coverings for higher order threshold implementations

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