Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures

DOI10.1007/978-3-319-66787-4_8zbMATH Open1450.94033OpenAlexW2741601269MaRDI QIDQ5114632FDOQ5114632

Authors: Dahmun Goudarzi, Matthieu Rivain, Damien Vergnaud, Srinivas Vivek 

Publication date: 24 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-66787-4_8

Recommendations

• Higher-order masking schemes for S-boxes
• Polynomial evaluation and side channel analysis
• Reducing the number of non-linear multiplications in masking schemes
• Efficient masked S-boxes processing -- a step forward
• Faster evaluation of sboxes via common shares

zbMATH Keywords

multiplicative complexitymaskingsoftware implementationblock-cipherside-channel countermeasures-box decomposition

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Algebraic decomposition for probing security
• Polynomial evaluation and side channel analysis
• Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
• A theoretical analysis of generalized invariants of bijective S-boxes
• Reducing the number of non-linear multiplications in masking schemes
• Side-channel attacks countermeasure based on decomposed S-boxes for Kuznyechik
• Breaking SIDH in polynomial time

This page was built for publication: Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures

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