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...
Saved in:
| Main Authors: | Maria Chiara Molteni, Jürgen Pulkus, Vittorio Zaccaria |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-03-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12048 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
MILP‐based security evaluation for AEGIS/Tiaoxin‐346/Rocca
by: Takuro Shiraya, et al.
Published: (2023-05-01) -
Bit‐level evaluation of piccolo block cipher by satisfiability problem solver
by: Shion Utsumi, et al.
Published: (2023-07-01) -
An Enhanced Multi-Layer Blockchain Security Model for Improved Latency and Scalability
by: Basem Mohamed Elomda, et al.
Published: (2025-03-01) -
On the performance of non‐profiled side channel attacks based on deep learning techniques
by: Ngoc‐Tuan Do, et al.
Published: (2023-05-01) -
PRIDA-ME: A Privacy-Preserving, Interoperable and Decentralized Authentication Scheme for Metaverse Environment
by: Mehmood Ul Hassan, et al.
Published: (2025-01-01)