© The Institution of Electrical Engineers
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.
References
-
-
1)
-
T.M. Apostol
.
(1976)
, Introduction to analytic number theory.
-
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)
-
R.C. Merkle ,
M.E. Hellman
.
Hiding information and signatures in trapdoor knapsacks.
IEEE Trans.
,
525 -
530
-
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
Related content
content/journals/10.1049/el_19820620
pub_keyword,iet_inspecKeyword,pub_concept
6
6