An improved knapsack public key cryptography system
by Sattar J. Aboud
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 3, No. 3, 2011

Abstract: This paper introduces and analyses cryptography attacks on knapsack public key cryptography that is relied on thought of Hwang scheme. That is, it relied on a new algorithm called permutation combination method. We will show that this scheme is not secure by using Shamir attack on the basic Merkle and Hellman knapsack method which is based on the existence of a sequence made from the public key. The Shamir attack holds over to multiply iterated knapsack cryptography; and that there is a similar sequence made from the public key. This can be employed to break multiply iterated knapsack cryptography given one can solve a specific non-linear difficulty. This non-linear difficulty is solved in the simplest case and then employed to provide a new cryptography attack on doubly iterated knapsack cryptography. Lastly, we give an improved version of Hwang scheme to avoid this attack.

Online publication date: Sat, 29-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com