Paper 2018/614 Original: eprint.iacr.org/2018/614 ↗
A Note on Key Rank
Abstract
In recent years key rank has become an important aspect of side-channel analysis, enabling an evaluation lab to analyse the security of a device after a side-channel attack. In particular, it enables the lab to do so when the enumeration effort would be beyond their computing power. Due to its importance there has been a host of work investigating key rank over the last few years. In this work we build upon the existing literature to make progress on understanding various properties of key rank. We begin by showing when two different "scoring methods" will provide the same rank. This has been implicitly used by various algorithms in the past but here it is shown for a large class of functions. We conclude by giving the computational complexity of key rank. This implies that it is unlikely for, considerably, better algorithms to exist.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2020-01-23: last updated
- 2018-06-22: published
- Short URL
- https://ia.cr/2018/614
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/614,
author = {Daniel P. Martin and Marco Martinoli},
title = {A Note on Key Rank},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/614},
year = {2018},
url = {https://eprint.iacr.org/2018/614}
}