Side-channel masking with pseudo-random generator
From MaRDI portal
Publication:2055660
DOI10.1007/978-3-030-45727-3_12zbMath1479.94146OpenAlexW2950621244MaRDI QIDQ2055660
Rina Zeitoun, Jean-Sébastien Coron, Aurélien Greuet
Publication date: 1 December 2021
Full work available at URL: http://orbilu.uni.lu/handle/10993/46425
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (7)
Private circuits with quasilinear randomness ⋮ Provable secure software masking in the real-world ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Side-channel masking with pseudo-random generator ⋮ Dummy shuffling against algebraic attacks in white-box implementations ⋮ On the power of expansion: more efficient constructions in the random probing model
Cites Work
- Private circuits: a modular approach
- Formal verification of side-channel countermeasures via elementary circuit transformations
- Side-channel masking with pseudo-random generator
- Amortizing randomness complexity in private circuits
- Verified Proofs of Higher-Order Masking
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Provably Secure Higher-Order Masking of AES
- Robust Pseudorandom Generators
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Advances in Cryptology - CRYPTO 2003
- Randomness Complexity of Private Circuits for Multiplication
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Side-channel masking with pseudo-random generator
