Faster evaluation of sboxes via common shares

DOI10.1007/978-3-662-53140-2_24MaRDI QIDQ1695997zbMATH OpenOpenAlexFDO

Authors Jean-Sébastien Coron, Aurélien Greuet, Emmanuel Prouff, Rina Zeitoun

Publication date 14 February 2018

Full work available at URL https://doi.org/10.1007/978-3-662-53140-2_24

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient masked S-boxes processing -- a step forward
• Higher-order masking schemes for S-boxes
• Reducing the number of non-linear multiplications in masking schemes
• A Very Compact “Perfectly Masked” S-Box for AES
• How fast can higher-order masking be in software?

Cited in

(7)

• Reducing the number of non-linear multiplications in masking schemes
• Fast verification of masking schemes in characteristic two
• Efficient masked S-boxes processing -- a step forward
• Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
• Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures
• Leakage-tolerant circuits
• Correlation power analysis and higher-order masking implementation of WAGE

This page was built for publication: Faster evaluation of sboxes via common shares

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