james@umcp-cs.UUCP (09/22/83)
I've just looked at a recent text on data encryption, and I think it said that although the knapsack encryption method is vulnerable to attacks in which the code-breaker knows a fair number of texts and their corresponding encryptions, that the iterated version (texts are encrypted n times with different knapsack methods) was still considered secure against such attacks. The "Leaky Knapsacks" article lists a reference concerning the cracking of the iterated version also...does anyone know more about the current status of the Iterated Merkle/Hellman Knapsack Problem? --Jim O'Toole james@umd-csd P.S. Reference listed was: Adleman, Leonard M. "On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem"