One-way functions using algorithmic and classical information theories

DOI10.1007/s00224-012-9418-zzbMath1261.68074OpenAlexW2137953452WikidataQ62038768 ScholiaQ62038768MaRDI QIDQ1946513

Yanyan Li

Publication date: 15 April 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/7072

zbMATH Keywords

Kolmogorov complexityone-way functionssymmetry of informationYao entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing notions of computational entropy
• Symmetry of information and one-way functions
• The world according to Rényi: Thermodynamics of multifractal systems
• On symmetry of information and polynomial time invertibility
• Some properties of Rényi entropy and Rényi entropy rate
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Foundations of Cryptography
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• On the Length of Programs for Computing Finite Binary Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A formal theory of inductive inference. Part I
• An introduction to Kolmogorov complexity and its applications
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: One-way functions using algorithmic and classical information theories