Cracking of the Merkle–Hellman Cryptosystem Using Genetic Algorithm

Zurab Kochladze, Lali Beselia · Transactions on Science and Technology · 2016

© Transactions on Science and Technology 2016 Introduction In 1978 the famous Merkle & Hellman (1978) article was published, which described an open key (asymmetric) cryptosystem based on a concrete case of the knapsack problem (Martello & Toth, 1990). We can formulate it as follows: there is a knapsack of V volume and a set of } ,... , { 2 1 n b b b B  subjects, which have certain volumes. Our goal is to find such B Bi  subset of B set, for the elements of which the following equation is worked out:

Read the paper · More papers on PaperTik