Unconditionally secure short key ciphers based on data compression and randomization
DOI10.1007/S10623-023-01195-8zbMATH Open1515.94090OpenAlexW4322494760WikidataQ122207829 ScholiaQ122207829MaRDI QIDQ6041583FDOQ6041583
Authors: B. Ya. Ryabko 
Publication date: 31 May 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01195-8
Recommendations
information theorycryptographydata compressionindistinguishabilityrandomisationperfect securityentropic securityShannon codeentropically-secure symmetric encryption schemeFitingof code
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Elements of Information Theory
- Title not available (Why is that?)
- Communication Theory of Secrecy Systems*
- Fast enumeration of combinatorial objects
- The Efficient Construction of an Unbiased Random Sequence
- Title not available (Why is that?)
- How to fool an unbounded adversary with a short key
- Theory of Cryptography
- On pseudorandom encodings
- Title not available (Why is that?)
- Fast and efficient construction of an unbiased random sequence
- A simply realizable ideal cryptographic system
- The Vernam cipher is robust to small deviations from randomness
- Asymptotic Nonparametric Statistical Analysis of Stationary Time Series
- Efficient homophonic coding
- Honey Encryption Beyond Message Recovery Security
- Honey encryption: security beyond the brute-force bound
Cited In (3)
This page was built for publication: Unconditionally secure short key ciphers based on data compression and randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041583)
