Secure FSM- based arithmetic codes
Hashem Moradmand Ziyabar, Mahnaz Sinaie, Ali Payandeh, Vahid Tabataba, Vakili

TL;DR
This paper introduces a secure image compression method combining finite state arithmetic coding with Huffman codes, enhancing security through random jumps and output swapping, while maintaining high compression efficiency.
Contribution
It proposes a novel Huffman Finite State Arithmetic Coding (HFSAC) scheme that integrates security features into arithmetic coding for real-time image encryption.
Findings
High compression efficiency maintained
Enhanced security through random jumps and output swapping
Effective in real-time image encryption and transmission
Abstract
Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, in this paper a method which adds secrecy to this well-known source code is proposed. Finite state arithmetic code (FSAC) is used as source code to add security. Its finite state machine (FSM) characteristic is exploited to insert some random jumps during source coding process. In addition, a Huffman code is designed for each state to make decoding possible even in jumps. Being Prefix free, Huffman codes are useful in tracking correct states for an authorized user when s/he decodes with correct symmetric pseudo random key. The robustness of our proposed scheme is further reinforced by adding another extra uncertainty by swapping outputs of Huffman codes in each state. Several test images are used for inspecting the validity of the proposed Huffman Finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Algorithms and Data Compression · Advanced Steganography and Watermarking Techniques
