On the security of the Merkle-Hellman cryptographic scheme

Cryptanalysis applied to a simple Merkle-Hellman (1978) public key cryptographic system (described within a standard-parameter knapsack problem) reveals the high vulnerability of the system. However, a cryptanalytic attack becomes ineffective when the knapsack problem with two or more iterations is used in order to obscure the structure of the superincreasing sequence. To enhance the security of a cryptographic system structured numbers can be used, while the multiple iterations of the modular multiplications technique can produce a safer Merkle-Hellman knapsack system.