Packed multiplication: how to amortize the cost of side-channel masking?
type: Item
instance of: scholarly article
title: Packed multiplication: how to amortize the cost of side-channel masking?
DOI: 10.1007/978-3-030-64837-4_28
author: Weijia Wang
author: Chun Guo
author: Yu Yu
author: Gaëtan Cassiers
author: François-Xavier Standaert
publication date: 2023-03-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7666655
zbMATH Keywords: higher-order masking countermeasures
zbMATH Keywords: \(\ell\) parallel field multiplications
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-64837-4 28
OpenAlex ID: W3091367000
cites work: Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
cites work: Horizontal side-channel attacks and countermeasures on the ISW masking scheme
cites work: Randomness Complexity of Private Circuits for Multiplication
cites work: Private multiplication over finite fields
cites work: Improved side-channel analysis of finite-field multiplication
cites work: Side-Channel Analysis of Multiplications in GF(2128)
cites work: Tight private circuits: achieving probing security with the least refreshing
cites work: Authenticated encryption: relations among notions and analysis of the generic composition paradigm
cites work: Towards sound approaches to counteract power-analysis attacks
cites work: Side-channel masking with pseudo-random generator
cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
cites work: Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
cites work: Amortizing randomness complexity in private circuits
cites work: How Fast Can Higher-Order Masking Be in Software?
cites work: Masking proofs are tight and how to exploit it in security evaluations
cites work: Invertible Universal Hashing and the TET Encryption Mode
cites work: Robust Pseudorandom Generators
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Very High Order Masking: Efficient Implementation and Security Evaluation
cites work: New instantiations of the CRYPTO 2017 masking schemes
cites work: A Fast and Provably Secure Higher-Order Masking of AES S-Box
cites work: On Masked Galois-Field Multiplication for Authenticated Encryption Resistant to Side Channel Analysis
cites work: Masking against Side-Channel Attacks: A Formal Security Proof
cites work: Polynomial Codes Over Certain Finite Fields
cites work: Provably Secure Higher-Order Masking of AES
cites work: Curve razionali normali e \(k\)-archi negli spazi finiti
cites work: New hash functions and their use in authentication and set equality
Recommended article: How Fast Can Higher-Order Masking Be in Software?
Recommended article: Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
Recommended article: Vectorizing Higher-Order Masking
Recommended article: Q4425701
Recommended article: Higher-Order Masking Schemes for S-Boxes
description: scientific article; zbMATH DE number 7666655