Affordable Access

Publisher Website

A secure and efficient entropy coding based on arithmetic coding

Authors
Journal
Communications in Nonlinear Science and Numerical Simulation
1007-5704
Publisher
Elsevier
Volume
14
Issue
12
Identifiers
DOI: 10.1016/j.cnsns.2009.03.003
Keywords
  • Data Security
  • Entropy Coding
  • Chaos
  • Arithmetic Coding
  • Nonlinear Dynamic Filter
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract A novel security arithmetic coding scheme based on nonlinear dynamic filter (NDF) with changeable coefficients is proposed in this paper. The NDF is employed to generate the pseudorandom number generator (NDF-PRNG) and its coefficients are derived from the plaintext for higher security. During the encryption process, the mapping interval in each iteration of arithmetic coding (AC) is decided by both the plaintext and the initial values of NDF, and the data compression is also achieved with entropy optimality simultaneously. And this modification of arithmetic coding methodology which also provides security is easy to be expanded into the most international image and video standards as the last entropy coding stage without changing the existing framework. Theoretic analysis and numerical simulations both on static and adaptive model show that the proposed encryption algorithm satisfies highly security without loss of compression efficiency respect to a standard AC or computation burden.

There are no comments yet on this publication. Be the first to share your thoughts.