A Low-Latency High-Order Arithmetic to Boolean Masking Conversion
Abstract: Masking, an effective countermeasure against side-channel attacks, is commonly applied in modern cryptographic implementations. Considering cryptographic algorithms that utilize both Boolean and arithmetic masking, the conversion algorithm between arithmetic masking and Boolean masking is required. Conventional high-order arithmetic masking to Boolean masking conversion algorithms based on Boolean circuits suffer from performance overhead, especially in terms of hardware implementation. In this work, we analyze high latency for the conversion and propose an improved high-order A2B conversion algorithm. For the conversion of 16-bit variables, the hardware latency can be reduced by 47% in the best scenario. For the case study of second-order 32-bit conversion, the implementation results show that the improved scheme reduces the clock cycle latency by 42% in hardware and achieves a 30% speed performance improvement in software. Theoretically, a security proof of arbitrary order is pro.... https://tches.iacr.org/index.php/TCHES/article/view/11441
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
A Low-Latency High-Order Arithmetic to Boolean Masking Conversion ; volume:2024 ; number:2 ; year:2024
IACR transactions on cryptographic hardware and embedded systems ; 2024, Heft 2 (2024)
- Urheber
-
Liu, Jiangxue
Zhao, Cankun
Peng, Shuohang
Yang, Bohan
Zhao, Hang
Han, Xiangdong
Zhu, Min
Wei, Shaojun
Liu, Leibo
- DOI
-
10.46586/tches.v2024.i2.630-653
- URN
-
urn:nbn:de:101:1-2024032017580961400225
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:44 MESZ
Datenpartner
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Liu, Jiangxue
- Zhao, Cankun
- Peng, Shuohang
- Yang, Bohan
- Zhao, Hang
- Han, Xiangdong
- Zhu, Min
- Wei, Shaojun
- Liu, Leibo