On robust strong‐non‐interferent low‐latency multiplications
Abstract The overarching goal of this work is to present new theoretical and practical tools to implement robust−t−probing security. In this work, a low‐latency multiplication gadget that is secure against probing attacks that exploit logic glitches in the circuit is presented. The gadget is the fir...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-IET
2022-03-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12048 |
| _version_ | 1797421653205975040 |
|---|---|
| author | Maria Chiara Molteni Jürgen Pulkus Vittorio Zaccaria |
| author_facet | Maria Chiara Molteni Jürgen Pulkus Vittorio Zaccaria |
| author_sort | Maria Chiara Molteni |
| collection | DOAJ |
| description | Abstract The overarching goal of this work is to present new theoretical and practical tools to implement robust−t−probing security. In this work, a low‐latency multiplication gadget that is secure against probing attacks that exploit logic glitches in the circuit is presented. The gadget is the first of its kind to present a 1‐cycle input‐to‐output latency while belonging to the class of probing security by optimized composition gadgets [6]. In particular, the authors show that it is possible to construct robust‐t‐strong‐non‐interferent gadgets without compromising on latency with a moderate increase in area. The authors provide a theoretical proof for the robustness of the gadget and show that, for t≤4, the amount of randomness required can even be reduced without compromising on robustness. |
| first_indexed | 2024-03-09T07:20:38Z |
| format | Article |
| id | doaj.art-24afc6ce5d34432c945b74de3520cd16 |
| institution | Directory Open Access Journal |
| issn | 1751-8709 1751-8717 |
| language | English |
| last_indexed | 2024-03-09T07:20:38Z |
| publishDate | 2022-03-01 |
| publisher | Hindawi-IET |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj.art-24afc6ce5d34432c945b74de3520cd162023-12-03T07:27:20ZengHindawi-IETIET Information Security1751-87091751-87172022-03-0116212713210.1049/ise2.12048On robust strong‐non‐interferent low‐latency multiplicationsMaria Chiara Molteni0Jürgen Pulkus1Vittorio Zaccaria2Dipartimento di Informatica “Giovanni Degli Antoni” Università degli Studi di Milano Milano ItalyG+D Mobile Security GmbH München GermanyDepartment of Electronics, Information and Bioengineering Politecnico di Milano Milano ItalyAbstract The overarching goal of this work is to present new theoretical and practical tools to implement robust−t−probing security. In this work, a low‐latency multiplication gadget that is secure against probing attacks that exploit logic glitches in the circuit is presented. The gadget is the first of its kind to present a 1‐cycle input‐to‐output latency while belonging to the class of probing security by optimized composition gadgets [6]. In particular, the authors show that it is possible to construct robust‐t‐strong‐non‐interferent gadgets without compromising on latency with a moderate increase in area. The authors provide a theoretical proof for the robustness of the gadget and show that, for t≤4, the amount of randomness required can even be reduced without compromising on robustness.https://doi.org/10.1049/ise2.12048cryptographysecurity |
| spellingShingle | Maria Chiara Molteni Jürgen Pulkus Vittorio Zaccaria On robust strong‐non‐interferent low‐latency multiplications IET Information Security cryptography security |
| title | On robust strong‐non‐interferent low‐latency multiplications |
| title_full | On robust strong‐non‐interferent low‐latency multiplications |
| title_fullStr | On robust strong‐non‐interferent low‐latency multiplications |
| title_full_unstemmed | On robust strong‐non‐interferent low‐latency multiplications |
| title_short | On robust strong‐non‐interferent low‐latency multiplications |
| title_sort | on robust strong non interferent low latency multiplications |
| topic | cryptography security |
| url | https://doi.org/10.1049/ise2.12048 |
| work_keys_str_mv | AT mariachiaramolteni onrobuststrongnoninterferentlowlatencymultiplications AT jurgenpulkus onrobuststrongnoninterferentlowlatencymultiplications AT vittoriozaccaria onrobuststrongnoninterferentlowlatencymultiplications |