On Renyi Entropies and their Applications to Guessing Attacks in  Cryptography

Serdar Boztas

Paper 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. IEICE Transactions on Fundamentals, 97-A(12):2014
Keywords: brute force guessing attacks predictability entropy
Contact author(s): serdar boztas @ rmit edu au
History: 2018-05-21: received
Short URL: https://ia.cr/2018/455
License: CC BY

BibTeX

@misc{cryptoeprint:2018/455,
      author = {Serdar Boztas},
      title = {On Renyi Entropies and their Applications to Guessing Attacks in  Cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/455},
      year = {2018},
      url = {https://eprint.iacr.org/2018/455}
}