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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Internet Technology and Secured Transactions
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
