Fast verification of masking schemes in characteristic two
type: Item
instance of: scholarly article
title: Fast verification of masking schemes in characteristic two
zbMATH Open document ID: 1479.94296
DOI: 10.1007/978-3-030-77886-6_10
author: Nicolas Bordes
author: Pierre Karpman
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7440610
zbMATH Keywords: high-order masking
zbMATH Keywords: probing model
zbMATH Keywords: multiplication gadget
zbMATH Keywords: refreshing gadget
zbMATH Keywords: linear code
describes a project that uses: Tornado
describes a project that uses: maskVerif
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 10
OpenAlex ID: W3166412651
cites work: Randomness Complexity of Private Circuits for Multiplication
cites work: Private multiplication over finite fields
cites work: Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
cites work: Tornado: automatic generation of probing-secure masked bitsliced implementations
cites work: Formal verification of masked hardware implementations in the presence of glitches
cites work: Tight private circuits: achieving probing security with the least refreshing
cites work: Faster evaluation of sboxes via common shares
cites work: Advances in cryptology -- EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 -- May 4, 2017. Proceedings. Part I
cites work: Making Masking Security Proofs Concrete
cites work: Constructive side-channel analysis and secure design. 9th international workshop, COSADE 2018, Singapore, April 23--24, 2018. Proceedings
cites work: Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
cites work: Vectorizing Higher-Order Masking
cites work: How Fast Can Higher-Order Masking Be in Software?
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Very High Order Masking: Efficient Implementation and Security Evaluation
cites work: Q4941869
cites work: Q2957449
cites work: New instantiations of the CRYPTO 2017 masking schemes
cites work: SILVER -- statistical independence and leakage verification
cites work: Q3932310
cites work: Q1622936
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
Recommended article: Verified Proofs of Higher-Order Masking
Recommended article: A fast algorithm for the Boolean masking problem
Recommended article: Reducing the number of non-linear multiplications in masking schemes
Recommended article: Efficient and Provably Secure Methods for Switching from Arithmetic to Boolean Masking
Recommended article: Very High Order Masking: Efficient Implementation and Security Evaluation
Recommended article: Masking proofs are tight and how to exploit it in security evaluations
Recommended article: A New Class of Codes for Boolean Masking of Cryptographic Computations
Recommended article: New instantiations of the CRYPTO 2017 masking schemes
Recommended article: Fast transforms over finite fields of characteristic two
Recommended article: Masking against Side-Channel Attacks: A Formal Security Proof
description: scientific article; zbMATH DE number 7440610