Joint compression and encryption using chaotically mutated Huffman trees

DOI10.1016/J.CNSNS.2009.11.022zbMATH Open1222.94032OpenAlexW2049601096WikidataQ120836011 ScholiaQ120836011MaRDI QIDQ720208FDOQ720208

Safya Belghith, Houcemeddine Hermassi, Rhouma Rhouma

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

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 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)

Cites Work

• Title not available (Why is that?)
• ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
• A Method for the Construction of Minimum-Redundancy Codes
• Arithmetic Coding
• Secure Arithmetic Coding
• Arithmetic coding as a non-linear dynamical system
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• Cryptanalysis of a spatiotemporal chaotic image/video cryptosystem

Cited In (1)

• Distributed source coding using chaos-based cryptosystem

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)