On Renyi Entropies and Their Applications to Guessing Attacks in Cryptography

Serdar BOZTAS

doi:10.1587/transfun.E97.A.2542

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Signal Design and Its Applications in Communications

On Renyi Entropies and Their Applications to Guessing Attacks in Cryptography

Serdar BOZTAS

Author information

Keywords: guessing, Renyi entropy, Shannon entropy, predictability, brute force attacks, cryptography, work factor

JOURNAL RESTRICTED ACCESS

2014 Volume E97.A Issue 12 Pages 2542-2548

DOI https://doi.org/10.1587/transfun.E97.A.2542

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!