Integrated encryption in dynamic arithmetic compression

DOI10.1007/978-3-319-53733-7_10MaRDI QIDQ5738993zbMATH OpenOpenAlexFDO

Authors Shmuel T. Klein, Dana Shapira

Publication date 1 June 2017

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-53733-7_10

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Integrated encryption in dynamic arithmetic compression
• scientific article; zbMATH DE number 67079
• Arithmetic coding of messages using random sequence
• scientific article; zbMATH DE number 1487949
• Image encryption based on arithmetic coding using an order-one Markov model

Cites work

• A secure arithmetic coding based on Markov model
• An efficient coding system for long source sequences
• Complexity aspects of guessing prefix codes
• Evaluation of parallel text alignment systems -- the ARCADE project
• Pattern matching in Huffman encoded texts

Cited in

(13)

• Comments on ``Arithmetic coding as a non-linear dynamical system
• Integrated encryption in dynamic arithmetic compression
• A new encoding decoding scheme for text compression with embedded security
• Image encryption based on arithmetic coding using an order-one Markov model
• Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
• The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption
• scientific article; zbMATH DE number 1424161 (Why is no real title available?)
• Theory of Cryptography
• Forward looking Huffman coding
• Compression-RSA technique: A more efficient encryption-decryption procedure
• Lightweight compression with encryption based on asymmetric numeral systems
• Selective dynamic compression
• Joint compression and encryption using chaotically mutated Huffman trees

This page was built for publication: Integrated encryption in dynamic arithmetic compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738993)