Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site umcp-cs.UUCP
Path: utzoo!linus!philabs!seismo!rlgvax!cvl!umcp-cs!james
From: james@umcp-cs.UUCP
Newsgroups: net.crypt
Subject: Iterated knapsack problem.
Message-ID: <2676@umcp-cs.UUCP>
Date: Wed, 21-Sep-83 18:12:51 EDT
Article-I.D.: umcp-cs.2676
Posted: Wed Sep 21 18:12:51 1983
Date-Received: Fri, 23-Sep-83 06:16:18 EDT
Organization: Univ. of Maryland, Computer Science Dept.
Lines: 15

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"