Revisiting a masked lookup-table compression scheme

DOI10.1007/978-3-319-71667-1_19MaRDI QIDQ1746854zbMATH OpenOpenAlexFDO

Authors Srinivas Vivek

Publication date 26 April 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71667-1_19

zbMATH Keywords

implementationblock ciphermaskingside-channel attack

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Higher order masking of look-up tables
• Masking tables -- an underestimated security risk
• Masking with randomized look up tables. Towards preventing side-channel attacks of all orders
• Time-memory trade-offs for side-channel resistant implementations of block ciphers
• Higher-order masking schemes for S-boxes

Cited in

(2)

• Mask compression: high-order masking on memory-constrained devices
• Time-memory trade-offs for side-channel resistant implementations of block ciphers

This page was built for publication: Revisiting a masked lookup-table compression scheme

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