Exploiting algebraic structures in probing security
From MaRDI portal
Publication:6604876
DOI10.1007/978-981-99-8730-6_8zbMATH Open1547.94405MaRDI QIDQ6604876FDOQ6604876
Authors: Maxime Plançon 
Publication date: 13 September 2024
Cites Work
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Title not available (Why is that?)
- Randomness Complexity of Private Circuits for Multiplication
- Advances in Cryptology - CRYPTO 2003
- Provably secure higher-order masking of AES
- Private circuits: a modular approach
- Horizontal side-channel attacks and countermeasures on the ISW masking scheme
- Higher-Order Side Channel Security and Mask Refreshing
- Masking against Side-Channel Attacks: A Formal Security Proof
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Random probing security: verification, composition, expansion and new constructions
- NTRU prime: reducing attack surface at low cost
- Private multiplication over finite fields
- How to securely compute with noisy leakage in quasilinear complexity
- Noisy Leakage Revisited
- Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
- On the power of expansion: more efficient constructions in the random probing model
- Dynamic random probing expansion with quasi linear asymptotic complexity
This page was built for publication: Exploiting algebraic structures in probing security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604876)
