Article View: sci.crypt
Article #2020New Encryption - a Challenge
From: Erik.Lindano
Date: Wed, 18 Nov 1992 21:54
Date: Wed, 18 Nov 1992 21:54
52 lines
2732 bytes
2732 bytes
Writes thompson@sun425.nas.nasa.gov (Keith C. Thompson): > And, there is one small problem. The issue is the unicity > distance of the algorithm. It is impossible to decrypt ciphertext > that is shorter than the unicity distance of the algorithm. For > instance, the ciphertext DFJUG resulting from a simple > substitution could be any five letter word that had no repeated > letters. OK, how many words/letters would you like? > It is possible that the surrounding context is insufficient to > determine the correct decryption. For instance, it could be a > proper noun that does not appear anywhere else in the plaintext. We'll give you as much text as you want (within reason - please!). You choose the plaintext. We can guarantee that the unknown word will also be found among the known ones. [But please don't ask for a two-word file then! :-) ] Or you could submit some pattern of your own, such as a numerical or alphabetic progression of any kind, any length. Or a large file consisting of nothing but zeroes, with one set of eight non-zero characters embedded in the middle. (Try that on RSA or DES). Name your poison. One smart cookie has already asked for a set of files incorporating a slowly-changing alphabetic progression... > The real question, is can you and your friend make a suitable > challenge such that people are willing to take you up on it. > After all, you are essentially asking others to expend a > potentially large amount of effort for little or no reward. > Think of it as a challenge... Thanks. WE are going to try. > Well, seeing as we have not heard from your friend, there is no > way for us to judge whether he is up on the technology in the > field or not. You have given us no indication that would suggest > that he is, and one that would suggest otherwise. We've asked no one to make such a judgement. We only want to know whether the experts here can break an encrypted message where only ONE WORD is not disclosed, under fair terms, or even terms of their own choosing. In any case, I can't _force him_ to post anything, but he might very well decide to do so. I sure hope he does, because you guys are beating the bejesus out of me. I can't take this any more! Aaaarrrgghhh..!! :-) --- Maximus 2.00
Technical Details
Message-ID:
<n0ef2t@ofa123.fidonet.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!usc!news.service.uci.edu!ucivax!ofa123!Erik.LindanoShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!usc!news.service.uci.edu!ucivax!ofa123!Erik.Lindano From: Erik.Lindano@ofa123.fidonet.org Newsgroups: sci.crypt Subject: New Encryption - a Challenge X-Sender: newtout 0.02 Nov 17 1992 Message-ID: <n0ef2t@ofa123.fidonet.org> Date: 18 Nov 92 21:54:24 Lines: 52