Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint
Lists
Only you see this
Abstract
We provide a new inequality that links two important entropy notions: Shannon Entropy \(H_1\) and collision entropy \(H_2\). Our formula gives the worst possible amount of collision entropy in a probability distribution, when its Shannon Entropy is fixed. While in practice it is easier to evaluate Shannon entropy than other entropy notions, it is well known in folklore that it does not provide a good estimate of randomness quality from a cryptographic viewpoint, except very special settings. Our results and techniques put this in a quantitative form, allowing us to precisely answer the following questions:
BibTeX
@inproceedings{skorski2015shannon,
author = {Maciej Skórski},
title = {{Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint}},
booktitle = {IMACC},
year = {2015},
url = {https://openreview.net/forum?id=lSXVclRyMG},
}Loading related content...