Criticism of Knapsack Encryption Scheme
Sattar J. Aboud

TL;DR
This paper critically analyzes a knapsack encryption scheme based on permutation combination, demonstrating its vulnerabilities and proposing an improved version to enhance security.
Contribution
The paper reveals the weaknesses of Su's permutation-based knapsack scheme and introduces an improved version to mitigate these security flaws.
Findings
Permutation method is ineffective for security.
The scheme can be broken using Shamir's algorithm.
An enhanced scheme is proposed to resist attacks.
Abstract
In this paper, we analyze a knapsack schemes. The one is suggested by Su, which is relied on a new method entitled permutation combination method. We demonstrate that this permutation method is useless to the security of the scheme. Since the special super increasing construction, we can break this scheme employ the algorithm provided by Shamir scheme. Finally, we provide an enhanced version of Su scheme to avoid these attacks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · graph theory and CDMA systems · Coding theory and cryptography
