Generalized arithmetic coding using discrete chaotic maps
From MaRDI portal
Publication:4907067
Recommendations
- Secure binary arithmetic coding based on digitalized modified logistic map and linear feedback shift register
- A secure and efficient entropy coding based on arithmetic coding
- Integrated encryption in dynamic arithmetic compression
- Joint compression and encryption using chaotically mutated Huffman trees
Cites work
- A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
- Adaptive Chosen-Ciphertext Attack on Secure Arithmetic Coding
- BREAKING AN IMAGE ENCRYPTION ALGORITHM BASED ON CHAOS
- ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
- Secure Arithmetic Coding
- Symmetric Ciphers Based on Two-Dimensional Chaotic Maps
Cited in
(5)- Low-Density Codes Based on Chaotic Systems for Simple Encoding
- Joint compression and encryption using chaotically mutated Huffman trees
- A block compressive sensing based scalable encryption framework for protecting significant image regions
- Generalized smooth transition map between tent and logistic maps
- Secure binary arithmetic coding based on digitalized modified logistic map and linear feedback shift register
This page was built for publication: Generalized arithmetic coding using discrete chaotic maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907067)