Joint compression and encryption using chaotically mutated Huffman trees

DOI10.1016/J.CNSNS.2009.11.022MaRDI QIDQ720208zbMATHOpenAlexWikidataFDO

Authors Houcemeddine Hermassi, Rhouma Rhouma, Safya Belghith

Publication date 13 October 2011

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cnsns.2009.11.022

zbMATH Keywords

Huffman treechaotic encryptionjoint compression and encryption

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Cryptography (94A60) Dynamical systems in control (37N35)

Recommendations

• The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption
• Integrated encryption in dynamic arithmetic compression
• Integrated encryption in dynamic arithmetic compression
• Generalized arithmetic coding using discrete chaotic maps
• scientific article; zbMATH DE number 67079

Cites work

• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Arithmetic Coding
• Cryptanalysis of a spatiotemporal chaotic image/video cryptosystem
• ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• Secure Arithmetic Coding

Cited in

(4)

• Generalized arithmetic coding using discrete chaotic maps
• Distributed source coding using chaos-based cryptosystem
• GLS coding based security solution to JPEG with the structure of aggregated compression and encryption
• Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes

This page was built for publication: Joint compression and encryption using chaotically mutated Huffman trees

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