On Renyi Entropies and Their Applications to Guessing Attacks in Cryptography

Serdar BOZTAS  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A    No.12    pp.2542-2548
Publication Date: 2014/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.2542
Type of Manuscript: Special Section INVITED PAPER (Special Section on Signal Design and Its Applications in Communications)
guessing,  Renyi entropy,  Shannon entropy,  predictability,  brute force attacks,  cryptography,  work factor,  

Full Text: PDF>>
Buy this Article

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.