Unconditionally secure short key ciphers based on data compression and randomization

DOI10.1007/S10623-023-01195-8MaRDI QIDQ6041583zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

information theorycryptographydata compressionindistinguishabilityrandomisationperfect securityentropic securityShannon codeentropically-secure symmetric encryption schemeFitingof code

Mathematics Subject Classification ID

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)

Recommendations

• Conditionally-perfect secrecy and a provably-secure randomized cipher
• scientific article; zbMATH DE number 177048
• Theory of Cryptography
• scientific article; zbMATH DE number 2086703
• Information Security and Privacy

Cites work

• scientific article; zbMATH DE number 4070801 (Why is no real title available?)
• scientific article; zbMATH DE number 3463523 (Why is no real title available?)
• scientific article; zbMATH DE number 3227613 (Why is no real title available?)
• A simply realizable ideal cryptographic system
• Asymptotic Nonparametric Statistical Analysis of Stationary Time Series
• Communication Theory of Secrecy Systems*
• Efficient homophonic coding
• Elements of Information Theory
• Fast and efficient construction of an unbiased random sequence
• Fast enumeration of combinatorial objects
• Honey Encryption Beyond Message Recovery Security
• Honey encryption: security beyond the brute-force bound
• How to fool an unbounded adversary with a short key
• On pseudorandom encodings
• The Efficient Construction of an Unbiased Random Sequence
• The Vernam cipher is robust to small deviations from randomness
• Theory of Cryptography

Cited in

(3)

• Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
• scientific article; zbMATH DE number 2086703 (Why is no real title available?)
• Rate-1 incompressible encryption from standard assumptions

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)