MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes
Threshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Information Security |
| Online Access: | http://dx.doi.org/10.1049/2024/8851878 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850105303560880128 |
|---|---|
| author | Botao Liu Ming Tang |
| author_facet | Botao Liu Ming Tang |
| author_sort | Botao Liu |
| collection | DOAJ |
| description | Threshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-threshold implementation (MS-LW-TI). First, we use MiniSat to optimally decompose an S-box into the least number of three different logic gate operations, AND, OR, and XOR. Among these operations, we define two primitives and the extension of two primitives for TI design. Furthermore, we prove that the primitives and their extensions strictly comply with the security properties. Finally, we implement MS-LW-TI on Xilinx Spartan-6 Field Programmable Gate Array (FPGA) to show that the S-boxes of PRESENT, GIFT, and PICCOLO consume only 17, 15, and 13 look-up-tables (LUTs), 16, 9, and 16 flip-flops (FFs), 6, 5, and 6 slices, respectively. Compared with the existing lightweight TI design, our TI for PRESENT S-box has a 22%, 38%, and 25% reduction of LUTs, FFs, and slices to the design by Shahmirzadi and Moradi at IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021, and our TI for GIFT S-box has a 6%, 25%, and 28% reduction of LUTs, FFs, and slices to the design by Jati et al., which is the smallest. |
| format | Article |
| id | doaj-art-3c98a56e468e4d5b9abe04d0d18f1328 |
| institution | OA Journals |
| issn | 1751-8717 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-3c98a56e468e4d5b9abe04d0d18f13282025-08-20T02:39:08ZengWileyIET Information Security1751-87172024-01-01202410.1049/2024/8851878MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxesBotao Liu0Ming Tang1Key Laboratory of Aerospace Information Security and Trusted ComputingKey Laboratory of Aerospace Information Security and Trusted ComputingThreshold implementation (TI) is a lightweight countermeasure against side-channel attacks when glitches happen. As to masking schemes, an S-box is the key part to protection. In this paper, we propose a general first-order lightweight TI scheme for 4 × 4 S-boxes and name it as MiniSat-lightweight-threshold implementation (MS-LW-TI). First, we use MiniSat to optimally decompose an S-box into the least number of three different logic gate operations, AND, OR, and XOR. Among these operations, we define two primitives and the extension of two primitives for TI design. Furthermore, we prove that the primitives and their extensions strictly comply with the security properties. Finally, we implement MS-LW-TI on Xilinx Spartan-6 Field Programmable Gate Array (FPGA) to show that the S-boxes of PRESENT, GIFT, and PICCOLO consume only 17, 15, and 13 look-up-tables (LUTs), 16, 9, and 16 flip-flops (FFs), 6, 5, and 6 slices, respectively. Compared with the existing lightweight TI design, our TI for PRESENT S-box has a 22%, 38%, and 25% reduction of LUTs, FFs, and slices to the design by Shahmirzadi and Moradi at IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES) 2021, and our TI for GIFT S-box has a 6%, 25%, and 28% reduction of LUTs, FFs, and slices to the design by Jati et al., which is the smallest.http://dx.doi.org/10.1049/2024/8851878 |
| spellingShingle | Botao Liu Ming Tang MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes IET Information Security |
| title | MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes |
| title_full | MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes |
| title_fullStr | MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes |
| title_full_unstemmed | MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes |
| title_short | MS-LW-TI: Primitive-Based First-Order Threshold Implementation for 4 × 4 S-boxes |
| title_sort | ms lw ti primitive based first order threshold implementation for 4 4 s boxes |
| url | http://dx.doi.org/10.1049/2024/8851878 |
| work_keys_str_mv | AT botaoliu mslwtiprimitivebasedfirstorderthresholdimplementationfor44sboxes AT mingtang mslwtiprimitivebasedfirstorderthresholdimplementationfor44sboxes |