Mixing Additive and Multiplicative Masking for Probing Secure Polynomial Evaluation Methods
Masking is a sound countermeasure to protect implementations of block- cipher algorithms against Side Channel Analysis (SCA). Currently, the most efficient masking schemes use Lagrange’s Interpolation Theorem in order to represent any S- box by a polynomial function over a binary finite field. Maski...
Main Authors: | Axel Mathieu-Mahias, Michaël Quisquater |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2018-02-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/837 |
Similar Items
-
Power-Balancing Software Implementation to Mitigate Side-Channel Attacks without Using Look-Up Tables
by: HanBit Kim, et al.
Published: (2020-04-01) -
Breaking Masked Implementations of the Clyde-Cipher by Means of Side-Channel Analysis
by: Aron Gohr, et al.
Published: (2022-08-01) -
Breaking Masked Implementations of the Clyde-Cipher by Means of Side-Channel Analysis
by: Aron Gohr, et al.
Published: (2022-08-01) -
Provably Secure Hardware Masking in the Transition- and Glitch-Robust Probing Model: Better Safe than Sorry
by: Gaëtan Cassiers, et al.
Published: (2021-02-01) -
Lightweight Conversion from Arithmetic to Boolean Masking for Embedded IoT Processor
by: HanBit Kim, et al.
Published: (2019-04-01)