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: | Maria Chiara Molteni, Jürgen Pulkus, Vittorio Zaccaria |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-IET
2022-03-01
|
Series: | IET Information Security |
Subjects: | |
Online Access: | https://doi.org/10.1049/ise2.12048 |
Similar Items
-
On the spectral features of robust probing security
by: Maria Chiara Molteni, et al.
Published: (2020-08-01) -
An application of the chinese remainder theorem to multiple-key encryption in database systems /
by: 170295 Cooper, R. H., et al. -
A New Class of Strongly Asymmetric PKA Algorithms: SAA-5
by: Luigi Accardi, et al.
Published: (2019-03-01) -
Lightweight and Low-Latency AES Accelerator Using Shared SRAM
by: Jae Seong Lee, et al.
Published: (2022-01-01) -
Towards Low-Latency Implementation of Linear Layers
by: Qun Liu, et al.
Published: (2022-03-01)