Article View: sci.crypt
Article #102Diophantine algorithm used to break knapsack cipher
From: Hsiao-Chiu Chu
Date: Wed, 28 Oct 1992 21:06
Date: Wed, 28 Oct 1992 21:06
17 lines
1235 bytes
1235 bytes
Dear Netters : I am curious if there is any information about how to apply Diophantine approximation to break a knapsack cipher. I have already found out to use Lenstra algorithm to find out the possible intervals that the trapdoor pairs exist. However, the range of possible trapdoor pair is so large ( for a n-bit knapsack cipher, the range is about 2**2n to 2**(2n+1)), so an exhausted search is not practical. I hope that I can get some information about what paper or book should I look into to apply Diophantine algorithm on finding knapsack pair. Any information will be appreciated heartily !! Hsiao-Chiu Chu Purdue University
Technical Details
Message-ID:
<1992Oct28.210631.19852@noose.ecn.purdue.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!iggy.GW.Vitalink.COM!cs.widener.edu!ukma!darwin.sura.net!spool.mu.edu!news.nd.edu!mentor.cc.purdue.edu!noose.ecn.purdue.edu!tuna.ecn.purdue.edu!hchuShow Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!iggy.GW.Vitalink.COM!cs.widener.edu!ukma!darwin.sura.net!spool.mu.edu!news.nd.edu!mentor.cc.purdue.edu!noose.ecn.purdue.edu!tuna.ecn.purdue.edu!hchu From: hchu@tuna.ecn.purdue.edu (Hsiao-Chiu Chu) Subject: Diophantine algorithm used to break knapsack cipher Message-ID: <1992Oct28.210631.19852@noose.ecn.purdue.edu> Sender: news@noose.ecn.purdue.edu (USENET news) Organization: Purdue University Engineering Computer Network Date: Wed, 28 Oct 1992 21:06:31 GMT Lines: 19