On Renyi Entropies and their Applications to Guessing Attacks in Cryptography

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

On renyi entropies and their applications to guessing attacks in cryptography

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. key words: guessing, Renyi entropy, Shannon entropy, predictability, brute force attacks, cryptography, work factor