Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate
We improve the state-of-the-art masking schemes in two important directions. First, we propose a new masked multiplication algorithm that satisfies a recently introduced notion called Probe-Isolating Non-Interference (PINI). It captures a sufficient requirement for designing masked implementations i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ruhr-Universität Bochum
2019-02-01
|
| Series: | Transactions on Cryptographic Hardware and Embedded Systems |
| Subjects: | |
| Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/7389 |
| _version_ | 1818147414730604544 |
|---|---|
| author | Gaëtan Cassiers François-Xavier Standaert |
| author_facet | Gaëtan Cassiers François-Xavier Standaert |
| author_sort | Gaëtan Cassiers |
| collection | DOAJ |
| description | We improve the state-of-the-art masking schemes in two important directions. First, we propose a new masked multiplication algorithm that satisfies a recently introduced notion called Probe-Isolating Non-Interference (PINI). It captures a sufficient requirement for designing masked implementations in a trivial way, by combining PINI multiplications and linear operations performed share by share. Our improved algorithm has the best reported randomness complexity for large security orders (while the previous PINI multiplication was best for small orders). Second, we analyze the security of most existing multiplication algorithms in the literature against so-called horizontal attacks, which aim to reduce the noise of the actual leakages measured by an adversary, by combining the information of multiple target intermediate values. For this purpose, we leave the (abstract) probing model and consider a specialization of the (more realistic) noisy leakage / random probing models. Our (still partially heuristic but quantitative) analysis allows confirming the improved security of an algorithm by Battistello et al. from CHES 2016 in this setting. We then use it to propose new improved algorithms, leading to better tradeoffs between randomness complexity and noise rate, and suggesting the possibility to design efficient masked multiplication algorithms with constant noise rate in F2. |
| first_indexed | 2024-12-11T12:34:52Z |
| format | Article |
| id | doaj.art-57718f5285ec475793da652acad6f141 |
| institution | Directory Open Access Journal |
| issn | 2569-2925 |
| language | English |
| last_indexed | 2024-12-11T12:34:52Z |
| publishDate | 2019-02-01 |
| publisher | Ruhr-Universität Bochum |
| record_format | Article |
| series | Transactions on Cryptographic Hardware and Embedded Systems |
| spelling | doaj.art-57718f5285ec475793da652acad6f1412022-12-22T01:07:09ZengRuhr-Universität BochumTransactions on Cryptographic Hardware and Embedded Systems2569-29252019-02-012019210.13154/tches.v2019.i2.162-198Towards Globally Optimized Masking: From Low Randomness to Low Noise RateGaëtan Cassiers0François-Xavier Standaert1ICTEAM/ELEN/Crypto Group, Université catholique de LouvainICTEAM/ELEN/Crypto Group, Université catholique de LouvainWe improve the state-of-the-art masking schemes in two important directions. First, we propose a new masked multiplication algorithm that satisfies a recently introduced notion called Probe-Isolating Non-Interference (PINI). It captures a sufficient requirement for designing masked implementations in a trivial way, by combining PINI multiplications and linear operations performed share by share. Our improved algorithm has the best reported randomness complexity for large security orders (while the previous PINI multiplication was best for small orders). Second, we analyze the security of most existing multiplication algorithms in the literature against so-called horizontal attacks, which aim to reduce the noise of the actual leakages measured by an adversary, by combining the information of multiple target intermediate values. For this purpose, we leave the (abstract) probing model and consider a specialization of the (more realistic) noisy leakage / random probing models. Our (still partially heuristic but quantitative) analysis allows confirming the improved security of an algorithm by Battistello et al. from CHES 2016 in this setting. We then use it to propose new improved algorithms, leading to better tradeoffs between randomness complexity and noise rate, and suggesting the possibility to design efficient masked multiplication algorithms with constant noise rate in F2.https://tches.iacr.org/index.php/TCHES/article/view/7389Maskingcomposabilityhorizontal attacksrandom probing model |
| spellingShingle | Gaëtan Cassiers François-Xavier Standaert Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate Transactions on Cryptographic Hardware and Embedded Systems Masking composability horizontal attacks random probing model |
| title | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate |
| title_full | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate |
| title_fullStr | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate |
| title_full_unstemmed | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate |
| title_short | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate |
| title_sort | towards globally optimized masking from low randomness to low noise rate |
| topic | Masking composability horizontal attacks random probing model |
| url | https://tches.iacr.org/index.php/TCHES/article/view/7389 |
| work_keys_str_mv | AT gaetancassiers towardsgloballyoptimizedmaskingfromlowrandomnesstolownoiserate AT francoisxavierstandaert towardsgloballyoptimizedmaskingfromlowrandomnesstolownoiserate |