Cryptology ePrint Archive: Report 2017/623

Back to Massey: Impressively fast, scalable and tight security evaluation tools

Marios O. Choudary and P.G. Popescu

Abstract: 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.

Category / Keywords: side-channel attacks, guessing entropy, bounds, scalability

Original Publication (in the same form): IACR-CHES-2017

Date: received 26 Jun 2017, last revised 26 Sep 2017

Contact author: marios choudary at cs pub ro, pgpopescu@yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20170926:171813 (All versions of this report)

Short URL: ia.cr/2017/623

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]