One-way functions using algorithmic and classical information theories
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1088242 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications
- Comparing notions of computational entropy
- Computational analogues of entropy
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Foundations of Cryptography
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On symmetry of information and polynomial time invertibility
- On the Length of Programs for Computing Finite Binary Sequences
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Some properties of Rényi entropy and Rényi entropy rate
- Symmetry of information and one-way functions
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The world according to Rényi: Thermodynamics of multifractal systems
Cited in
(4)
This page was built for publication: One-way functions using algorithmic and classical information theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946513)