Resisting the bergen-hogan attack on adaptive arithmetic coding

Abstract

Arithmetic coding is an optimal data compression algorithm in terms of entropy. As it is a shortest length coding, it is well recognized that the randomness of the output of arithmetic coding is very good. Based on arithmetic coding, we propose a novel encryption algorithm. The algorithm can resist existing attacks on arithmetic coding encryption algorithms. The statistical properties of the system are very good. General approach to attack this algorithm is difficult. The algorithm is easily programmed. The algorithm on its own is also an effective data compression algorithm. The compression ratio is only 2% worse than the original arithmetic coding algorithm.