JUST SOME RANDOM STUFF!

[ByteInBits]

IS THERE ANYONE OUT THERE WHO IS LIKE ME?

I love messing about randomly to see what comes about, maybe at sometime I will
discover some amazing thing! I do things like the following:

I took the 1st 400 decimal digits of Pi and paired them like so. . .

14,15,92,65,35,89,79,32,38,46,26,43,38,32,79,50,28,84,19,71,69,39,93,75,10,58,20,97,49,44,59,23,07,81,64,06,28,29,25,40,91,71,53,64,36,78,92,59,03,01,13,30,53,05,48,82,04,66,52,13,84,14,69,51,94,15,11,60,94

then I took each (pair mod 26)+1 and took the alphabet position A=1 .. Z=26 and

that produced (my 200 Pi letters)

OPONJLBGMUARMGBYCGTTRNPXKGUTXSHXHDMGCKIVICDWZIVRGBEOCIZGEEOVJMSIRYGWFUBHODCWLRTCGKBBPHVKDHMUWQLCPDDSSCDJXOHHSJCVEWXLIAFNBMBMNTMHOOIIIIKTRAMENNKHACXOMVUTJAOGFDKRWDAJUSCDZONTBMKAOHDIBNEBFWEEOANGORZQPLIQ

then I used a Vigenere Solver to Decrypt it with the long 100 key of:
kpxjglonfqjnmpxyptfcnuitgpmfkoqpuvytytiifuddsprvyiqxjignxpxrjaovdfckrbuhxzkpdzlpncbomorxkaicwylzldqp

and that gave:

EAREDANTHEREAREANNORETHEERIONERINIONERANDIATHTEWITORTATTHPREAMENOTEMOTHARESHISINTIANDTENTHESASADEANDINGARDTUNTTISHANTHALOSTTHEACEASTONMATHEWITHEINGTONEWASITIONANDMORNATINTMENALLISTOLDNTINHEAFESTOREISB

ran this through the wordninja in python which gave:

EARED AN THERE ARE AN NORE THE ERI ONE RINI ONE RAN DIA TH TE WI TORT AT TH PRE A ME NOTE MOTH ARE SHI SINTI AND TEN THE S AS A DE AND IN GARD TUN TT IS HAN TH A LOST THE ACE ASTON MA THE WITH EING TONE WAS IT ION AND MORNA TINT MEN ALL IS TOLD NT IN HE A FEST OR EISB

meaningless, but having many English words is a surprise.

=======================
Again my 200 Pi letters
OPONJLBGMUARMGBYCGTTRNPXKGUTXSHXHDMGCKIVICDWZIVRGBEOCIZGEEOVJMSIRYGWFUBHODCWLRTCGKBBPHVKDHMUWQLCPDDSSCDJXOHHSJCVEWXLIAFNBMBMNTMHOOIIIIKTRAMENNKHACXOMVUTJAOGFDKRWDAJUSCDZONTBMKAOHDIBNEBFWEEOANGORZQPLIQ

Now Vigenere Solver solving as a running key with 100 letters:
Key:
drovqxjoicaaidirutrlyfbdxabmtldgddugpraiipkpvrcdnnsoabzndtgifjfcykmlcuihbljplycynkqixortzpmhodfunwzz

gave following ‘plaintext’:
LYASTOSSESAREDTHINCITIOUNGTHEHEREASANTINANTHERTOTOMACHATBLINEDNGTOULDATANSTHATRETALTSTERESANINGICHETHEDREAPPORCEATEEANDFIENSANTAKHEREISTEHERNARAWLEATHITHTONESCESANDBEISWOUTOURTOOMEINTINDANKINTGETINEEX

and wordnija gave
LY AS TOSSES A RED THIN CITI O UNG THE HERE AS ANTIN ANTHER TO TO MACH ATB LINED NG TOUL DATA NS THAT RET A LTS TERESA NING ICHE THE D REAP PORC EAT EE AND FI EN SANTA K HERE ISTE HE RNA RAW LEA THI TH TONES CES AND BE IS W OUT OUR TOOME IN TIN DANK IN T GET IN E EX

Well SANTA got in there!

===========================
Yet Again my 200 Pi letters
OPONJLBGMUARMGBYCGTTRNPXKGUTXSHXHDMGCKIVICDWZIVRGBEOCIZGEEOVJMSIRYGWFUBHODCWLRTCGKBBPHVKDHMUWQLCPDDSSCDJXOHHSJCVEWXLIAFNBMBMNTMHOOIIIIKTRAMENNKHACXOMVUTJAOGFDKRWDAJUSCDZONTBMKAOHDIBNEBFWEEOANGORZQPLIQ

vigenere
key length:200
and key is:
vikaqexpichkipxgjzpcnvwqgpqbeldgdltzytedpvzfvqckckawjbvpamvofvoqyrcfbciakmyeskplcsiulqrskaidsysvlmzazvzstwoaosydlptueimgxvxuumiqkwpbergbytinjvrawltwtoqcfivzbmgzdwwsqajwvxjbifgjkpkbxwajmpankiuzkegjlypj

gave a repeating sequence !
THEN THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THERE S THEN THEN TH

My own edits:
THEN THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THEN THEN TH
or the above as:
THEN THERE’S THE REST, HERE’S THE REST, HE REST HER EST. HERE’S THE REST. HERE ST. HERES, THERE ST. HERES. THERE’S THE RE’S, THE RE’S THERE. ST. HERES THERE’S THE REST HERE’S THE REST HERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THERE’S THE N THE N’TH

——————————————–
Talk about Monkeys and Typewriters!!!

[bridges]

If your keys are truly random then it’s impressive and totally unexpected.
I’m assuming you used a solver which chooses the most likely key. If the key is as long as the ciphertext, a key exists for every possible message of that length.
When the key is half the length, it’s no wonder that a key exists which produces many words even though the text didn’t come from a plaintext.

[Mattyrat2027]

@bridges
Correct me if I’m wrong, but is a Vigenère cipher where key length=text length just a One-Time Pad? I remember we had some fun a few years back with the concept of Two-Time Pads, since a One-Time Pad is mathematically proven to be uncrackable (for the very reason that you can decipher a ciphertext into any text you like given a specific key).

[Astralica]

I agree with @bridges, it is possible to make the digits of pi say absolutely anything:

It’s just that Vigenere is truly unsolvable if the key is perfectly random and as long as the ciphertext. (One-time pads)
The reason (I’m assuming) you’re seeing repeated “THERES” is that it scores the highest on whatever fitness function you’re using, so as the computer tries to optimise for English by hill climbing, it just outputs that a bunch of times.

Here’s some examples for you.

Your original 200 digits of pi:
OPONJLBGMUARMGBYCGTTRNPXKGUTXSHXHDMGCKIVICDWZIVRGBEOCIZGEEOVJMSIRYGWFUBHODCWLRTCGKBBPHVKDHMUWQLCPDDSSCDJXOHHSJCVEWXLIAFNBMBMNTMHOOIIIIKTRAMENNKHACXOMVUTJAOGFDKRWDAJUSCDZONTBMKAOHDIBNEBFWEEOANGORZQPLIQ

Here’s the key to make it the first 200 characters of the Bee Movie script:
ONMZSITTGBMRBVRLOKGIRRXJFGZLXZZJUKFCLGADVOHWBIUNCJXAIXWFAENKFTEDGAYDNYTUILCFHYFOOYBQEOHEZOEBELLJEVKZHYCVUQTCNQVRYFJRVXMGXLXIZOKTUXQEDXCPZAZGRNMGWAXUURTPFILSSKIRFZECUZVJNOABIFCNEZLAPYQJNODTKCJVDDDPELGG

…and here’s the key for the Fitness Gram Pacer test:
VIKIBSOCUCUAMUMYACCANVWPSGIZMZZFODGCCGRHHUBUZTVPYIGVYQGNXEVGSYMRNGOOKQQJIZJEZDCYDCWWHFBZKHUMDOXPWVQYOKKCTCDOOSNVCSGSEIMRTBQLJNEUGBQEGUXQZPERJTVHHJQKUCUCQHHCOJXEOQURFOYAHVNCIUSPALSKATLVBDMZOIUCXNZOIZAD

 

[_madness_]

Should array indices start at 0 or 1? My suggested compromise of 0.5 was rejected without, I thought, proper consideration.
— Stan Kelly-Bootle

[Astralica]

Courtesy of Dreamberd (best programming language):

Some languages start arrays at 0, which can be unintuitive for beginners. Some languages start arrays at 1, which isn’t representative of how the code actually works. DreamBerd does the best of both worlds: Arrays start at -1.

That does seem weird, but it is not a bad starting point. Spacetime has four dimensions, space has three, the plane is two dimensional while  the line is one. If a point has dimension 0, what else could be the dimension of the empty set, and where else could you start? Harry

[ByteInBits]

I put this up to see what sort of responces would be given,
I wasn’t disapoined!

@bridges A lot of truth there
@Mattyrat2027 Your first post in a long while, I remember too
@ASTALICA 🙂 🙂 🙂 Love it! And the decrypts are:

according to all known laws of aviation there is no way a bee should be
able to fly its wings are too small to get its fat little body off the ground
the bee of course flies anyway because bees dont care what humans think is
impossible yellow black

the fitness gram pacer test is a multistage aerobic capacity
test that progressively gets more difficult as it continues
the meter pacer test will begin in seconds line up at the start
the running speed starts slowly but gets faster each min

[Mattyrat2027]

@ByteInBits Yep, still lurking around…

I never did manage to crib-drag my way to a solved two-time pad. Maybe one day.

We ran this as a fun challenge at a couple of the Bletchley Prize Giving events. Maybe we will re-introduce that some time. Harry

[Immortal-Sect-Elder-Heavenly-Sum-of-the-Positive-Integers]

Ah, esteemed friend, this humble one has two matters upon which to reflect and offer discourse. Pray, allow me to lay them before you in the manner of a wanderer sharing his observations by the light of the moon.

First, I shall speak of a curious observation regarding the modulo. It is my humble assertion that there exists a symmetry in the distribution of values, where those from 0 to 21 are met with equal likelihood, whilst those from 22 to 25 find themselves somewhat less fortunate, their occurrence a touch rarer. Let me explain: imagine, if you will, that there exists a one in one hundred chance of obtaining each of the values from 00, 01, 02, all the way to 97, 98, 99. However, once the modulo is invoked, all multiples of 26 are bound together as equals, as if by the hand of fate. Thus:

0 = 26 = 52 = 78
1 = 27 = 53 = 79
…
20 = 46 = 72 = 98
21 = 47 = 73 = 99
22 = 48 = 74
23 = 49 = 75
24 = 50 = 76
25 = 51 = 77

From this, it becomes clear: the first twenty-two values, from 0 to 21, are each bestowed a chance of 4 in 100, or 1 in 25, to be selected, whilst the last four, those from 22 to 25, are only granted a chance of 3 in 100. Though my knowledge in such matters is not so profound, I cannot say with certainty that this affects the peculiar density of words and near-words that emerge from the cipher’s depths. Nevertheless, it is a curious statistical anomaly worthy of mention. The thought has crossed this one’s mind, too, that the letters X and Z, being among those rarest, may show a tendency to remain unchanged, or perhaps transform into the likes of Q or J with greater frequency than one might expect. A mystery indeed.

Now, to the second point, which I offer in the spirit of humble inquiry. Pray, enlighten me: did you employ the aid of an automatic breaker, one that calculates the key with precision, or was the key chosen at random, as one might pick a stone from a brook? Should the former be true, then the Vigenere solver would, I surmise, divide the ciphertext — if one may call it so in such a situation as this — into columns, many columns, as one divides a finely ground powder into neat portions, and endeavour to make each of these columns conform to the distribution of letters in standard English. Once all these columns, shaped by the solver’s hand, are reunited, the resulting “plaintext” will take on the semblance of standard English, or at least, something akin to it. It is my belief that this is the root of the strange proliferation of words, and half-formed words, that emerge from the cipher’s cryptic embrace. Yet, I find myself pondering the matter further.

Could it be that the effect is more pronounced when the key is short, such that the “ciphertext” is divided into columns of but a few characters in length, and thus, each Caesar cipher run upon each column does not so much emulate the structure of standard English as it simply fills the result with the most common of letters? That is to say, should one run a Caesar cipher on a fragment of text such as “AAB,” it would not result in a refined word, but merely “eet,” the most frequent letters in English. Would then, the ‘plaintext’ outputted not simply be a series of “e”s, “t”s and “a”s

And what of the situation when the key is so long as to match the ‘ciphertext’s length? Surely, I ask, would this not result in an outcome where each column is reduced to a single letter — thus making the ‘plaintext’ a simple pattern, repeating, repeating, where all characters are “e”s? I admit, my understanding of the Vigenere solver’s workings grows murkier with each passing moment. The mind struggles to grasp how 200 characters with a 200-long key could result in such a simple pattern. Perhaps there is a fitness method, more advanced than I know, which eludes my grasp.

But alas, should you have used a randomly generated key, then this humble one is left quite perplexed, my thoughts in disarray, like a leaf caught in the winds of fate. Truly, the mysteries of the cipher stretch beyond the reach of my current understanding.

And so, dear friend, I offer these musings not as conclusions, but as the curious thoughts of one who has wandered far and pondered much. Perhaps we shall discover the answer together, in time.

[Author]

Posts