International Association for Cryptologic Research

International Association
for Cryptologic Research

Transactions on Cryptographic Hardware and Embedded Systems, Volume 2024

A Low-Latency High-Order Arithmetic to Boolean Masking Conversion


Jiangxue Liu
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Cankun Zhao
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Shuohang Peng
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Bohan Yang
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Hang Zhao
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Xiangdong Han
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, ChinaBeijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Min Zhu
Wuxi Micro Innovation Integrated Circuit Design Co., Ltd., Wuxi, China

Shaojun Wei
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China

Leibo Liu
Beijing National Research Center for Information Science and Technology, School of Integrated Circuits, Tsinghua University, Beijing, China


Keywords: Masking, Arithmetic masking to Boolean masking conversion algorithms, Probe Isolating Non-Interference, Hardware Private Circuit, Test Vector Leakage Assessment


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 provided for the proposed high-order A2B conversion. Experimental validations are performed to verify the second-order DPA resistance of second-order implementation. The Test Vector Leakage Assessment does not observe side-channel leakage for hardware and software implementations.

Publication

Transactions of Cryptographic Hardware and Embedded Systems, Volume 2024, Issue 2

Paper

Artifact

Artifact number
tches/2024/a12

Artifact published
May 31, 2024

Badge
🏆 IACR CHES Results Reproduced

README

ZIP (5299948 Bytes)  

View on Github

License
GPLv3 This work is licensed under the GNU General Public License version 3.

Some files in this archive are licensed under a different license. See the contents of this archive for more information.


BibTeX How to cite

Liu, J., Zhao, C., Peng, S., Yang, B., Zhao, H., Han, X., … Liu, L. (2024). A Low-Latency High-Order Arithmetic to Boolean Masking Conversion. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2024(2), 630–653. https://doi.org/10.46586/tches.v2024.i2.630-653 Artifact available at https://artifacts.iacr.org/tches/2024/a12