From: MeM on 19 Apr 2010 05:06 On Apr 18, 11:49 pm, Ostap Bender <ostap_bender_1...(a)hotmail.com> wrote: > On Apr 14, 9:16 pm, purple <pur...(a)colorme.com> wrote: > > > > > > > On 4/14/2010 7:47 PM, Ostap Bender wrote: > > > > On Apr 14, 5:35 pm, purple<pur...(a)colorme.com> wrote: > > >> On 4/14/2010 6:38 PM, Ostap Bender wrote: > > > >>> On Apr 12, 7:44 am, purple<pur...(a)colorme.com> wrote: > > >>>> On 4/12/2010 6:33 AM, Don Stockbauer wrote: > > > >>>>> On Apr 9, 6:03 am, "Ostap S. B. M. Bender Jr." > > >>>>> <ostap_bender_1...(a)hotmail.com> wrote: > > >>>>>> On Apr 8, 5:34 am, Link<marty.musa...(a)gmail.com> wrote: > > > >>>>>>> On Apr 8, 3:03 am, "Ostap S. B. M. Bender Jr." > > > >>>>>>> <ostap_bender_1...(a)hotmail.com> wrote: > > >>>>>>>> On Apr 8, 2:59 am, "marty.musa...(a)gmail.com" > > > >>>>>>>> <me...(a)vzw.blackberry.net> wrote: > > >>>>>>>>>> On Apr 7, 5:30 pm, Link<marty.musa...(a)gmail.com> > > >>>>>>>>>> wrote: > > >>>>>>>>>>> The key to cracking any cipher is elephant. Simply > > >>>>>>>>>> look for consistent > > >>>>>>>>>>> variable repetition following the form of the word > > >>>>>>>>>> elephant. There are > > >>>>>>>>>>> very few words in language that repeat letters in > > >>>>>>>>>> the pattern of the > > >>>>>>>>>>> word elephant. > > > >>>>>>>>>>> ELEPHANT > > > >>>>>>>>>>> 12134567 > > > >>>>>>>>>>> ANARCHY > > > >>>>>>>>>>> ERELATER > > > >>>>>>>>>> ERE-what?! And how many E's are there? > > > >>>>>>>>> I don't know how many E's there are yet because I don't know what "e" is yet. You are missing the point I fear. > > >>>>>>>>> The point is it does not matter. What matters is finding the ordered repetition modelling the word then try all letters. > > > >>>>>>>>> ERELATER could be a remnant fragment of a continuing sentence of a continuous cipher. > > > >>>>>>>>> the example might be [h]"ere later" preceeded by "meet me" > > > >>>>>>>> You are way too brilliant for me. > > > >>>>>>> Thank you for the compliment, but I insist I am not. > > > >>>>>>> I am just saying, trying to make a simple point about ciphers, that, > > >>>>>>> by assuming knowledge of the key and acting on it, this is the best > > >>>>>>> way to decrypt. The numbers of times letters repeat in three letters > > >>>>>>> being two, as in the beginning three letters of elephant is a great > > >>>>>>> start. > > > >>>>>>> The word elephant does not actually have to be there. Any of the below > > >>>>>>> representations could be the word elephant. > > > >>>>>>> E L E P H A N T > > > >>>>>>> M A M O C D T O > > > >>>>>>> T O T I A B C D > > > >>>>>>> The point is you have letter 1, followed by letter 2, then letter 1 > > >>>>>>> again, followed by a continues four unique letters different from the > > >>>>>>> first three spaces occupied by the first two characters. > > > >>>>>> That's brilliant. Unfortunately for you, the string "ERELATER" does > > >>>>>> NOT satisfy your condition. Hint: it has three occurrences of letter > > >>>>>> "E". > > > >>>>>>> Try this method to any language cipher and you may find it is > > >>>>>>> effective. > > > >>>>>> Thank you. Next time I need to decipher what my little daughter writes > > >>>>>> to her little sister - I will. > > > >>>>> Better off to work towards creating a world where ciphers aren't > > >>>>> needed. > > > >>>> When Garfield becomes president your wish will come true! > > > >>> That's already happened: > > > >>>http://en.wikipedia.org/wiki/James_A._Garfield > > > >>> James Abram Garfield (November 19, 1831 September 19, 1881) was the > > >>> 20th President of the United States. > > > >> Wrong Garfield. > > > >>http://www.garfield.com/ > > > > I suspect that either you think there exists only one Garfield in the > > > World OR you have no sense of humor OR both. > > > There is one god, there is one Garfield, and thank god and Garfield > > there is only one you. Or is there...... > > No. There are quit ea few Ostaps Benders in this World. There is even > a Wikipedia article about us.- Hide quoted text - > > - Show quoted text - Strange. =//
From: purple on 19 Apr 2010 09:15 On 4/19/2010 4:06 AM, MeM wrote: > On Apr 18, 11:49 pm, Ostap Bender<ostap_bender_1...(a)hotmail.com> > wrote: >> On Apr 14, 9:16 pm, purple<pur...(a)colorme.com> wrote: >> >> >> >> >> >>> On 4/14/2010 7:47 PM, Ostap Bender wrote: >> >>>>>>>> Better off to work towards creating a world where ciphers aren't >>>>>>>> needed. >> >>>>>>> When Garfield becomes president your wish will come true! >> >>>>>> That's already happened: >> >>>>>> http://en.wikipedia.org/wiki/James_A._Garfield >> >>>>>> James Abram Garfield (November 19, 1831 � September 19, 1881) was the >>>>>> 20th President of the United States. >> >>>>> Wrong Garfield. >> >>>>> http://www.garfield.com/ >> >>>> I suspect that either you think there exists only one Garfield in the >>>> World OR you have no sense of humor OR both. >> >>> There is one god, there is one Garfield, and thank god and Garfield >>> there is only one you. Or is there...... >> >> No. There are quit ea few Ostaps Benders in this World. There is even >> a Wikipedia article about us.- Hide quoted text - >> > Strange. Yet somehow not compelling. *Garfield for President!!!!!!!!!!!!!!!*
First
|
Prev
|
Pages: 1 2 3 4 Prev: What do you think of this Blowfish implementation? Next: TrueCrypt broken |