How iterative transformations can help to crack the Merkle-Hellman cryptographic scheme

Access Full Text

How iterative transformations can help to crack the Merkle-Hellman cryptographic scheme

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

While it is generally expected that iterative transformations make a public key knapsack more secure, it is shown how two transformations can crack knapsacks which cannot be solved after one transformation. This leads to a new algorithm to crack cryptographic knapsack problems.

Inspec keywords: codes; iterative methods; cryptography

Other keywords: Merkle-Hellman cryptographic scheme; cracking technique; public key knapsack; iterative transformations

Subjects: Codes

References

    1. 1)
      • T.M. Apostol . (1976) , Introduction to analytic number theory.
    2. 2)
      • Desmedt, Y., Vandewalle, J., Govaerts, R.: `Critical analysis of the security of knapsack public key algorithms', IEEE International Symposium on Information Theory, 1982, p. 115–116, Abstracts of Papers.
    3. 3)
      • R.C. Merkle , M.E. Hellman . Hiding information and signatures in trapdoor knapsacks. IEEE Trans. , 525 - 530
    4. 4)
      • Shamir, A.: `A polynomial time algorithm for breaking Merkle-Hellman cryptosystems', Internal Report Applied Mathematics, .
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19820620
Loading

Related content

content/journals/10.1049/el_19820620
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading