搜索结果: 1-14 共查到“higher-order masking”相关记录14条 . 查询时间(0.093 秒)
One Fault is All it Needs: Breaking Higher-Order Masking with Persistent Fault Analysis
fault attacks masking persistent
2019/1/9
Persistent fault analysis (PFA) was proposed at CHES 2018 as a novel fault analysis technique. It was shown to completely defeat standard redundancy based countermeasure against fault analysis. In thi...
Sharing Independence & Relabeling: Efficient Formal Verification of Higher-Order Masking
masking formal verification domain-oriented masking
2018/11/2
The efficient verification of the security of masked hardware implementations is an important issue that hinders the development and deployment of randomness-efficient masking techniques. At EUROCRYPT...
Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
various contexts implementation constraints
2018/4/4
In this paper, we optimize the performances and compare several recent masking schemes in bitslice on 32-bit arm devices, with a focus on multiplication. Our main conclusion is that efficiency (or ran...
The cost of higher-order masking as a countermeasure against side-channel attacks is often considered too high for practical scenarios, as protected implementations become very slow. At Eurocrypt 2017...
Correction on “Further Improving Efficiency of Higher-Order Masking Schemes by Decreasing Randomness Complexity”
masking scheme side-channel attacks probing model
2017/12/27
Provably secure masking schemes always require too many random generations, which significantly increases the implementation cost. Recently in IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (...
A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'
higher-order masking probing security
2017/11/1
Zhang, Qiu and Zhou propose two optimised masked algorithms for computing functions of the form x↦x⋅ℓ(x)x↦x⋅ℓ(x) for any linear function ℓℓ. They claim ...
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Higher-Order Masking Boolean Functions Multiplicative Complexity
2016/6/6
Higher-order masking is a widely used countermeasure to
make software implementations of blockciphers achieve high security levels
against side-channel attacks. Unfortunately, it often comes with a
...
How Fast Can Higher-Order Masking Be in Software?
Side-Channel Countermeasures Higher-Order Masking Bitslice
2016/3/9
It is widely accepted that higher-order masking is a sound countermeasure to protect
implementations of block ciphers against side-channel attacks. The main issue while designing such
a countermeasu...
In this paper, we study the problem of automatically verifying higherorder
masking countermeasures. This problem is important in practice (weaknesses
have been discovered in schemes that were though...
Compositional Verification of Higher-Order Masking: Application to a Verifying Masking Compiler
Masking Composition Formal Methods
2015/12/30
The prevailing approach for building masked algorithms that can resist
higher-order differential power analysis is to develop gadgets, that is, masked
gates used as atomic blocks, that securely impl...
We describe a new algorithm for masking look-up tables of block-ciphers at any order, as a countermeasure against side-channel attacks. Our technique is a generalization of the classical randomized ta...
Analysis and Improvement of the Generic Higher-Order Masking Scheme of FSE 2012
masking complexity addition chain
2014/3/12
Masking is a well-known technique used to prevent block cipher implementations from side-channel attacks. Higher-order side channel attacks (e.g. higher-order DPA attack) on widely used block cipher l...
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data by the addition of ...
Higher-order Masking and Shuffling for Software Implementations of Block Ciphers– Extended Version –
Higher-order Masking Software Implementations Block Ciphers
2009/9/2
Differential Power Analysis (DPA) is a powerful side channel
key recovery attack that efficiently breaks block ciphers implementations.
In software, two main techniques are usually applied to thwart...