Affirmative - Crypto-Challenge

moose · Post by **moose** » Sat Jul 09, 2011 2:05 pm

Hi,

I've found the "yes"-message, but I have no idea how to go on. Is another method combined with this one? Is this a false path?

Sat Jul 09, 2011 2:40 pm

It is not a false path, you are halfway there.

moose · Post by **moose** » Wed Aug 24, 2011 11:43 am

So I guess I have to combine it with another method. At the moment I have a lot of characters (well ...2 different ones - 0d, 0a - but they occur quite often) which do not make any sense to me. I guess case sensitivity is important?
I have no clue how to continue ...

Wed Aug 24, 2011 12:41 pm

moose wrote:I guess case sensitivity is important?

:-)

bryluk · Post by **bryluk** » Tue Nov 08, 2011 10:20 am

Hey,
I know that there are specific sequenzes which occur quiet often.
But I don't know what to do with them.
Any hint please?!

Rodbert · Post by **Rodbert** » Tue Nov 08, 2011 4:23 pm

You are doing it wrong.
Big big hint: Get the "Big picture".

General_Payne · Post by **General_Payne** » Fri Dec 09, 2011 8:21 am

so i get the yes code.
I presumed since it is divisible by 8 each line is binary using capitols. But i get nonsense.

A hint would be much appreciated.

Thanks

Payne

Fri Dec 09, 2011 5:12 pm

The trick is to see the forest for the trees

hacker.org

Affirmative - Crypto-Challenge

Affirmative - Crypto-Challenge

Re: Affirmative - Crypto-Challenge

cant solve