๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A secure arithmetic coding based on Markov model

โœ Scribed by Lili Duan; Xiaofeng Liao; Tao Xiang

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
793 KB
Volume
16
Category
Article
ISSN
1007-5704

No coin nor oath required. For personal study only.

โœฆ Synopsis

We propose a modification of the standard arithmetic coding that can be applied to multimedia coding standards at entropy coding stage. In particular, we introduce a randomized arithmetic coding scheme based on order-1 Markov model that achieves encryption by scrambling the symbols' order in the model and choosing the relevant order's probability randomly, which is done with higher compression efficiency and good security. Experimental results and security analyses indicate that the algorithm can not only resist to existing attacks based on arithmetic coding, but also be immune to other cryptanalysis.

๐Ÿ“œ SIMILAR VOLUMES

On the insecurity of arithmetic coding
On the insecurity of arithmetic coding
โœ John G. Cleary; Sean A. Irvine; Ingrid Rinsma-Melchert ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 863 KB
Design of a fault-tolerant arithmetic ci
Design of a fault-tolerant arithmetic circuit based on distributed coding and its evaluation
โœ Takeshi Kasuga Member; Michitaka Kameyama; Tatsuo Higuchi ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 805 KB

## Abstract The robust fault tolerance is a property that even if an error occurs in the arithmetic circuit, the result of operation does not differ much from the correct value. Such a property will become more important in the construction of a highly safe system. In the present digital system, th