Originally posted by Joe

---

Hmm, there's only 15 different characters in that encrypted string. Since the "6" character only shows up once, it's possible this example encrypted string doesn't cover the full alphabet. Assuming an alphabet of 16 characters, the ability to process arbitrary binary data, and no compression, your method expands data by at least 200% and the decrypted data is no more than 62 bytes long.

I think that's about all I can figure out about it.

---

The decrypted data is actually more than 62 bytes long, no compression methods used. Anyways, some hints as a guy on another board actually works with this kind of stuff and told me it's impossible to crack without something to go on. Whether he's lying about that, I dunno.

The end result will be in English using a roman alphabet. There's a typo in the unencrypted text since I'm retarded.
There is no punctuation or special ascii characters involved.
It's split into 5 parts. If you can find one part and figure that out, the rest should fall into line shortly.

____________________

╕..Х 'ии)) -:ж:- ╕.Х' .Х'ии)) Katelynn -:ж:- ((╕╕.Х' д ║░ д -:ж:-

(п`Х.Х┤п) (п`Х.Х┤п) *`Х.╕(п`Х.Х┤п)╕.Х┤ д ║░ д`Х.╕.Х┤ д ║░ д

---

Lewis: Ok, we need to gain the trust of some villagers.
TotalBiscuit: I think Simon's qualified to do that!
*Simon approaches a villager and summons a swarm of angry bees*
Simon: Hello! Do you like bees!?
*The villager drops dead from the bees*
Simon: Oh dear... Um, that could have gone better...

---

Ok, so time has passed. My encryption didn't exactly make it to the top, as the class teacher that this is for melted through it like butter, cracking it in 2 minutes. As such, I'm at liberty to share it :V

The base string was "whoever can decode this probably isnt a genius simply because i spent so little effort int making this encryption method". Yes, there was a typo.

Step 1: Take your string and separate every character, replacing them as follows: a = 0, b = 1 ... j = 9, k = 0A, l = B0, m = 0C, etc. Follow up until you reach F0. After that, q = 1A, r = B1, etc. Do this for every character, then recombine the entire string, ignoring the spaces in the source string. Or, for the lazy, just run it through the encrypter I programmed (to be released sometime in the next 1000 years when I stop being lazy)
Step 2: You take the end result after running it through the encrypter and separate the string into 32 byte long strings. The last one will likely not be 32 bytes long.
Step 3: The last sequence is then tossed into the middle of the encrypted string, separating the other 32 byte sequences. Those sequences are then swapped, so sequence A is now where sequence B should be and vice versa.
Step 4: Number the subsequences in A and B, then flip those around in reverse.
Step 5: combine and replace all instances of A within the string with Z, B with Y, etc. And there you have it.

This doesn't take into account numbers, punctuation, symbols or capital letters in the source string. My teacher said that it wasn't the best, but that I was in the top 5 in the class. It kinda scares me that I've surpassed people who claim to have a background in computer security, and these people are hoping to take this class and their experience into government jobs at the NSA, CIA and so on.

____________________

╕..Х 'ии)) -:ж:- ╕.Х' .Х'ии)) Katelynn -:ж:- ((╕╕.Х' д ║░ д -:ж:-

(п`Х.Х┤п) (п`Х.Х┤п) *`Х.╕(п`Х.Х┤п)╕.Х┤ д ║░ д`Х.╕.Х┤ д ║░ д

---

Lewis: Ok, we need to gain the trust of some villagers.
TotalBiscuit: I think Simon's qualified to do that!
*Simon approaches a villager and summons a swarm of angry bees*
Simon: Hello! Do you like bees!?
*The villager drops dead from the bees*
Simon: Oh dear... Um, that could have gone better...

---