Paper 2018/175 Original: eprint.iacr.org/2018/175 ↗
Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys
Abstract
Evaluation of security margins after a side-channel attack is an important step of side-channel resistance evaluation. The security margin indicates the brute force effort needed to recover the key given the leakages. In the recent years, several solutions for key rank estimation algorithms have been proposed. All these solutions give an interesting trade-off between the tightness of the result and the time complexity for symmetric key. Unfortunately, none of them has a linear complexity in the number of subkeys, hence these solutions are slow for large (asymmetric) keys. In this paper, we present a solution to obtain a key rank estimation algorithm with a reasonable trade-off between the efficiency and the tightness that is suitable for large keys. Moreover, by applying backtracking we obtain a parallel key enumeration algorithm.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2018-02-14: last updated
- 2018-02-14: published
- Short URL
- https://ia.cr/2018/175
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/175,
author = {Vincent Grosso},
title = {Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/175},
year = {2018},
url = {https://eprint.iacr.org/2018/175}
}