Image encryption based on arithmetic coding with order-1 Markov model | Zendy

Lili Duan | Zendy; Xiaofeng Liao | Zendy; Tao Xiang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Image encryption based on arithmetic coding with order-1 Markov model

Author(s) -

Lili Duan,

Xiaofeng Liao,

Tao Xiang

Publication year - 2010

Publication title -

acta physica sinica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.199

H-Index - 47

ISSN - 1000-3290

DOI - 10.7498/aps.59.6744

Subject(s) - arithmetic coding , computer science , encryption , theoretical computer science , algorithm , coding (social sciences) , data compression , markov chain , cryptanalysis , huffman coding , context adaptive binary arithmetic coding , computer engineering , arithmetic , computer security , mathematics , statistics , machine learning

Encryption based on compression can provide compression and encryption in a single step, in which redundancy is removed by compression and security is guaranteed by encryption. A novel secure arithmetic coding scheme based on order-1 Markov model is proposed in this paper, and it is applied to image encryption where images can be transmitted securely on the Internet and the proposed algorithm significantly improve the compression efficiency of coding. Experimental results and security analyses indicate that, the algorithm can not only resist existing attacks based on arithmetic coding, but also be immune to other cryptanalysis.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research