Modulus Computational Entropy

DOI10.1007/978-3-319-04268-8_11zbMath1395.94312arXiv1302.2128OpenAlexW2152968475MaRDI QIDQ2948262

Maciej Skórski

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2128

Mathematics Subject Classification ID

Cryptography (94A60) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A counterexample to the chain rule for conditional HILL entropy ⋮ Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy ⋮ A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage

Cites Work

• A Mathematical Theory of Communication
• Some Notions of Entropy for Cryptography
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• A Pseudorandom Generator from any One-way Function
• Overcoming Weak Expectations
• A Counterexample to the Chain Rule for Conditional HILL Entropy
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Modulus Computational Entropy