Housepets!

5 years ago, when I was learning French at school, it was quite fun trying to read English words following the French rules...

P.S. And it took me a lot of time to realise that 'ß' is read like a long 's' sound

6, I'm back

7, I just tried to google OUUMTG, but only ****...

WB Gecko!

lol, the forum just autocorrected the word for poop of male cows into 4 stars.

8, Hi, Gecko!


Render, no time to praise the state-of-the-art technology of auto-correcting, we need to get clues out of him!
*Puts his 'salesman's smile' back on*

9, seems like the new mods are posting XD Hello

10, PLEASE give us another example. Bananas don't help...

11, okay This will make it a bit easier

12, you sure? Doesn't look easy to me...

13, Render, any ideas about the necessity of splitting the text into two lines?

14, no, that's what i am also wondering about. I'm pretty that the lines will be read just after another at the end because there are 11 words and 10 spaces and not only 9 spaces.

15

16

17, we all are.. to some extent

18, I confirm.

19, aww... XP

20, Sorry for dissapointing you.
he-he-he-he-he-he

OK, What I'm thinking of right now

From 2 examples we have 3 letters repeating a few times
3 'a's from 'Banana'
3 'l's from 'Hello world'
2 'o's from 'Hello world'

_a_a_a = _u_m_g
__llo_o_l_ = __olw_e_ _
If we number every single character in the alphabet + ' ', starting with 'a'=0
_0_0_0 = _20_12_6
__111114_14_11_ = __141122_4_26_

Any ideas on how to tie these numbers together, Render? Or I'm just completely insane already? There should be some certain increment that changes the letter's code after its repetition!!!

21

It drives me crazy that the repeating a's and n's in banana don't show up in any way in the code. I already tried to find out any rule of adding, subtracting, or multiplying the numbered letters with anything. That would be BANANA: +13 +20 +7 +12 +6 +6 / HELLOWORLD: -6 +5 +3 0 +8 -2 -10 -15 -12 +4 => No visuable rule.

Don't know if it may possible any difference if we start with a=0 oder a=1 or a=10... or counting backwards z=1 and a=26...

22, what about 'uu' from 'banana'`s encrypted form?

P.S. I say, we use this for the next cipher for Gecko

If it is different, we'll probably notice it...

23, the enigma? That's been cracked, and really unfair. XD

24, the UU is too early I think. And they are directly lines up, no other letters in between.
Maybe we should adjust his ear a little so he will look like Maxwell.

It was only cracked, after it was stolencaptured.

25, Which once again proves that German engineering was, is, and will be awesome!

I've tried adding the 'numbers' of the letters the way they are written (in 2 rows), like in 'hello world' it looked like h+w,e+o, etc.
It was 29 18 18 22 17 - and became 21 13 16 37 29
I still can't see anything

26, I just found something, but I am not sure, if it is the clue.
O is the 15th letter, if you start from the O on your keyboard and count letter by letter, row by row, 15 keys later you arrive at the B... but how to continue.

NO, that cannot be the trick. But it is a funny coincident.

27
Hey! No keyboards involved.

28,
using another system I've got

23 5 20 22 14 to 33 24 16 11 23

The differences are not the same, so looks like summing up the order of letters is a dead-end again.
But it can't be too difficult, because in that case it would be unsolvable
Also it should be possible to be unciphered using pen and paper + REASONABLE amount of time... I hope so
And we still have to understand, why he decided to split the text into two rows...

29, something to get on other thoughts in between.

30, for this cipher, ciphering it will take a lot more time than deciphering. Making that code actually took quite some time.

Cotton Eye Joe!

31, so you basically want to say that we're missing out something obvious...

Sounds more like that story with the egg and Columbus. We'll never get it unless someone is striken by an inspiration or an obvious clue.
Let's hope the first will happen sooner.

32, it's not that obvious without the clue that I would never point out again

33
What about this start:
OUU -> 15 21 21
MTG -> 13 20 7
OUU-MTG -> 2 1 14 -> BAN

but how do I get the ANA behind the BAN. And this is not working for the HELLOWORLD-code.

Gecko, again? You did it already? o.O

GeckoZY wrote:0, this is basically a modified substitution cipher, just as another hint:

' ' = 0, a = 1, ... , z = 26, etc.
~some magic~
~some more magic~
0 = ' ', 1 = a, ... , 26 = z, etc.
Voila!

This simplifies the problem a lot. You would have probably guessed or thought of this by now. XD

If he's referring to this one, then
a)I'm an idiot because I still can't really get it.
b)This doesn't explain the 2 rows... And it seems like it shouldn't
34

35, you will never get it!!



Edit: Oh, you've found it...

36, I never forgot the a=1-thing. But it is not so helpfull as you think.

37, I have a feeling that the important part is that a=1 becomes 1=a.
We need to get the new numbers, that would mean something out of any of the ways that we can write the ciphered text down. Similar to what you did in 33
And two rows have to do something with it.
*leaves to try multiplication*

38, I could have made it arbitrary, or random; that would easily triple the difficulty.

MvM for the most active topic. XD

39, how wrong is my ?

40, yeah you're pretty much in the right track

41, OUU+MTG...
13+15, 20+21, 7+21
We get 28, 41, 28
-27
1,14,1
ANA

Now we need to apply the same method to helloworld for test)

42, ah... +

43, it works on helloworld for me

Render... YOU ARE AWESOME!!!

44, it really works