Now showing items 1-2 of 2

  • On the insecurity of arithmetic coding

    Cleary, John G.; Irvine, Sean A.; Rinsma-Melchert, Ingrid (1994-06)
    Arithmetic coding is a technique which converts a given probability distribution into an optimal code and is commonly used in compression schemes. The use of arithmetic coding as an encryption scheme is considered. The ...
  • The subset sum problem and arithmetic coding

    Irvine, Sean A.; Cleary, John G.; Rinsma-Melchert, Ingrid (University of Waikato, Department of Computer Science, 1995-03)
    The security offered by symmetric cryptosystems based on the arithmetic coding algorithm is examined. It is shown that this can be reduced naturally to the subset sum problem. The subset sum problem is NP-complete, however, ...

Ingrid Rinsma-Melchert has 2 co-authors in Research Commons.