CryptoDB

Paper: Back to Massey: Impressively Fast, Scalable, and Tight Security Evaluation Tools

Authors: Marios O. Choudary P. G. Popescu DOI: 10.1007/978-3-319-66787-4_18 Search ePrint Search Google CHES 2017 None of the existing rank estimation algorithms can scale to large cryptographic keys, such as 4096-bit (512 bytes) RSA keys. In this paper, we present the first solution to estimate the guessing entropy of arbitrarily large keys, based on mathematical bounds, resulting in the fastest and most scalable security evaluation tool to date. Our bounds can be computed within a fraction of a second, with no memory overhead, and provide a margin of only a few bits for a full 128-bit AES key.
BibTeX
@inproceedings{ches-2017-28925,
title={Back to Massey: Impressively Fast, Scalable, and Tight Security Evaluation Tools},
booktitle={Cryptographic Hardware and Embedded Systems – CHES 2017},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={10529},
pages={367-386},
doi={10.1007/978-3-319-66787-4_18},
author={Marios O. Choudary and P. G. Popescu},
year=2017
}