Show simple item record  

dc.contributor.authorIrvine, Sean A.
dc.contributor.authorCleary, John G.
dc.contributor.authorRinsma-Melchert, Ingrid
dc.date.accessioned2008-10-20T22:34:45Z
dc.date.available2008-10-20T22:34:45Z
dc.date.issued1995-03
dc.identifier.citationIrvine, S. A., Cleary, J. G. & Rinsma-Melchert, I. (1995). The subset sum problem and arithmetic coding. (Working paper 95/7). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1085
dc.description.abstractThe 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, the cases which arise in practical cryptosystems based on this problem tend to be solvable in polynomial time because the sums formed are either superincreasing or of low density. Our attack is therefore similar to attacks on public-key cryptosystems based on the subset sum problem (knapsack systems).en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_US
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.titleThe subset sum problem and arithmetic codingen_US
dc.typeWorking Paperen_US
uow.relation.series95/7


Files in this item

This item appears in the following Collection(s)

Show simple item record