Cryptology ePrint Archive: Report 2018/455

On Renyi Entropies and their Applications to Guessing Attacks in Cryptography

Serdar Boztas

Abstract: We consider single and multiple attacker scenarios in guessing and obtain bounds on various success parameters in terms of Renyi entropies. We also obtain a new derivation of the union bound.

Category / Keywords: foundations / brute force guessing attacks, predictability, entropy

Original Publication (in the same form): IEICE Transactions on Fundamentals, 97-A(12):2014

Date: received 15 May 2018

Contact author: serdar boztas at rmit edu au

Available format(s): PDF | BibTeX Citation

Version: 20180521:164236 (All versions of this report)

Short URL: ia.cr/2018/455


[ Cryptology ePrint archive ]