Efficient Table-Based Masking with Pre-processing

Abstract: Masking is one of the most investigated countermeasures against sidechannel attacks. In a nutshell, it randomly encodes each sensitive variable into a number of shares, and compiles the cryptographic implementation into a masked one that operates over the shares instead of the original sensitive variables. Despite its provable security benefits, masking inevitably introduces additional overhead. Particularly, the software implementation of masking largely slows down the cryptographic implementations and requires a large number of random bits that need to be produced by a true random number generator. In this respect, reducing the< overhead of masking is still an essential and challenging task. Among various known schemes, Table-Based Masking (TBM) stands out as a promising line of work enjoying the advantages of generality to any lookup tables. It also allows the pre-processing paradigm, wherein a pre-processing phase is executed independently of the inputs, and a much more efficie.... https://tches.iacr.org/index.php/TCHES/article/view/11679

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Efficient Table-Based Masking with Pre-processing ; volume:2024 ; number:3 ; year:2024 ; IACR transactions on cryptographic hardware and embedded systems ; 2024, Heft 3 (2024)

Contributors, Places and Time

• Creator: Zhang, Juelin ; Wang, Taoyun ; Sun, Yiteng ; Ji, Fanjie ; Wang, Bohan ; Li, Lu ; Yu, Yu ; Wang, Weijia

Further information

• DOI: 10.46586/tches.v2024.i3.273-301
• URN: urn:nbn:de:101:1-2407241855424.614334073121
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 14.08.2025, 10:57 AM CEST