You are looking at a specific version 20180521:164236 of this paper.
See the latest version.
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)
- Category
- Foundations
- Publication info
- Published elsewhere. IEICE Transactions on Fundamentals, 97-A(12):2014
- Keywords
- brute force guessing attackspredictabilityentropy
- Contact author(s)
- serdar boztas @ rmit edu au
- History
- 2018-05-21: received
- Short URL
- https://ia.cr/2018/455
- License
-
CC BY