Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint

DOI10.1007/978-3-319-27239-9_16zbMath1376.94020OpenAlexW2398403988MaRDI QIDQ3460111

Maciej Skórski

Publication date: 12 January 2016

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_16

zbMATH Keywords

Renyi entropyShannon entropymin-entropylambda w functionsmooth Renyi entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (1)

Diversity of sharp restart

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A universal statistical test for random bit generators
• Universal classes of hash functions
• Randomness is linear in space
• An Introduction to Randomness Extractors
• A Pseudorandom Generator from any One-way Function
• Overcoming Weak Expectations
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• True Random Number Generators Secure in a Changing Environment
• Leftover Hash Lemma, Revisited
• On the Randomness of Independent Experiments
• The Complexity of Estimating Rényi Entropy
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Theory of Cryptography

This page was built for publication: Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint