Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[Tylui]

That's what I meant. Each letter represents a different missing character. Not one-to-one, but one-to-many. Such as n could be a caret, but so could s.

If that were the case, it would leave no 2 on its own. However, there would be no follow-up character for the number after the s. What would be particularly nasty is if the letters could be more than one character:

s = ^1
n = ^1

[Twi]

Don't forget: There's a 12, as Leonardo so well pointed out.

Tylui, if the letters could be more than one character, the cipher would be as frustrating for the intended recipient as for us. Kinda pointless.

[Aklyon]

hmm...

[SHAD0Wdump]

Aw... No progress since I left for sleep?

[Twi]

I was also asleep.

[LeoLeonardoIII]

That makes sense, except that would lead to double spaces in certain places. They'd have to represent many different things, which we have no way of knowing until we figure out something else.
The letters may well be nulls, simply there to confuse us.

I think double spaces are okay. After all, the main point is to get the recipient to be able to understand the message. That means you have to have separators for words so they don't misinterpret and blend them together, and you need separators for sentences.

Good catch Tylui with the letters ascending regularly. That suggests the letters are just spacers that we should ignore, but I think that's unlikely: why would he have exactly all 26 alphabet letters present once each?

Also a bit of meta-decoding: if it were based on a decoding tool that we don't have, it would be too difficult and he would never have used it. A good example I've used before is a common book that both the sender and receiver have access to. Your code is a series of page numbers. The translation is each page's first letter. You use multiple pages with the same letter to throw off frequency-based translation. Pages divisible by 11 are used strictly for punctuation and those divisible by 13 for spaces, pages divisible by 9 are used for numbers, ascending. Unless you know and have the book you're pretty much screwed. And if both sender and receiver have many books, all without marks in them, how in the world will you know?

[SHAD0Wdump]

I designed the encryption method myself and encrypted the message by hand.

[Skibiliano]

. . . . . . . . . .
Also a bit of meta-decoding: if it were based on a decoding tool that we don't have, it would be too difficult and he would never have used it. A good example I've used before is a common book that both the sender and receiver have access to. Your code is a series of page numbers. The translation is each page's first letter. You use multiple pages with the same letter to throw off frequency-based translation. Pages divisible by 11 are used strictly for punctuation and those divisible by 13 for spaces, pages divisible by 9 are used for numbers, ascending. Unless you know and have the book you're pretty much screwed. And if both sender and receiver have many books, all without marks in them, how in the world will you know?

The encryption nor the decryption have a key,
The crypt can be encrypted manually or with a program and the decryption can be done manually or with a program too.
And you can decrypt it no matter of the temperature, the weather, the kind of salt you're using and the set of books which you have.

[SHAD0Wdump]

The encryption nor the decryption have a key,
The crypt can be encrypted manually or with a program and the decryption can be done manually or with a program too.
And you can decrypt it no matter of the temperature, the weather, the kind of salt you're using and the set of books which you have.

He's right ya know.