Arithmetic Addition over Boolean Masking
From MaRDI portal
Publication:2794517
DOI10.1007/978-3-319-28166-7_27zbMath1423.94103OpenAlexW2466176639MaRDI QIDQ2794517
Tim Güneysu, Amir Moradi, Tobias Schneider
Publication date: 10 March 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_27
Related Items
A holistic approach towards side-channel secure fixed-weight polynomial sampling ⋮ Masking Large Keys in Hardware: A Masked Implementation of McEliece ⋮ ParTI – Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Secure hardware implementation of nonlinear functions in the presence of glitches
- Side-channel resistant crypto for less than 2,300 GE
- Leakage assessment methodology. A clear roadmap for side-channel evaluations
- Addition with Blinded Operands
- On the Simplicity of Converting Leakages from Multivariate to Univariate
- Higher-Order Threshold Implementations
- Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
- Pushing the Limits: A Very Compact and a Threshold Implementation of AES
- The Stream Cipher HC-128
- Threshold Implementations Against Side-Channel Attacks and Glitches
- Correlation-Enhanced Power Analysis Collision Attack
- Side-Channel Analysis of Six SHA-3 Candidates
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- Techniques for Random Masking in Hardware
- Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
- Efficient and Provably Secure Methods for Switching from Arithmetic to Boolean Masking
- A More Efficient AES Threshold Implementation
- Power Analysis Attacks
- Secure Conversion between Boolean and Arithmetic Masking of Any Order
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
This page was built for publication: Arithmetic Addition over Boolean Masking
