Paper 2022/1282

Comparing Key Rank Estimation Methods

Rebecca Young, University of Bristol
Luke Mather, PQ Shield
Elisabeth Oswald, University of Klagenfurt
Abstract

Recent works on key rank estimation methods claim that algorithmic key rank estimation is too slow, and suggest two new ideas: replacing repeat attacks with simulated attacks (PS-TH-GE rank estimation), and a shortcut rank estimation method that works directly on distinguishing vector distributions (GEEA). We take these ideas and provide a comprehensive comparison between them and a performant implementation of a classical, algorithmic ranking approach, as well as some earlier work on estimating distinguisher distributions. Our results show, in contrast to the recent work, that the algorithmic ranking approach outperforms GEEA, and that simulation based ranks are unreliable.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. CARDIS 2022
Keywords
Key Rank
Contact author(s)
elisabeth oswald @ aau at
History
2022-09-28: approved
2022-09-27: received
See all versions
Short URL
https://ia.cr/2022/1282
License
Creative Commons Attribution-NonCommercial
CC BY-NC

BibTeX

@misc{cryptoeprint:2022/1282,
      author = {Rebecca Young and Luke Mather and Elisabeth Oswald},
      title = {Comparing Key Rank Estimation Methods},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1282},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1282}},
      url = {https://eprint.iacr.org/2022/1282}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.