Search found 8 matches

by knox
Thu Nov 06, 2008 7:45 am
Forum: Challenges
Topic: didactic text
Replies: 21
Views: 47807

Do not use the phrase but just one word as the answer.

Maybe you could remove the phrase from your above post to keep the challenge for other users.
by knox
Wed Nov 05, 2008 10:15 am
Forum: Challenges Solved
Topic: More Dastardly
Replies: 10
Views: 1136

Using rainbow tables helped in reversing the md5 hash.
by knox
Wed Nov 05, 2008 10:13 am
Forum: Challenges Solved
Topic: UpCount
Replies: 28
Views: 2528

I guess the smartest idea is a simple rewrite as a non-recursive function. :wink:
by knox
Tue Nov 04, 2008 11:54 am
Forum: Challenges
Topic: UpCount - recursive calamity
Replies: 18
Views: 26741

I think donster's post is giving to much hint on solving the challenge. Maybe the post should be censored.
by knox
Thu Oct 16, 2008 2:35 pm
Forum: Challenges
Topic: Didactic Feedback Cipher
Replies: 23
Views: 45189

Pretty simple indeed.

Another great example for "think before you code something" :D
by knox
Tue Oct 14, 2008 9:38 am
Forum: Challenges
Topic: Didactic Long XOR challenge
Replies: 9
Views: 12460

tails wrote:no relation among the keys
Thanks a lot for clarifying this to me! Obviously i have mixed up the terms "cipher" and "key" (should have consulted a dictionary)...
by knox
Mon Oct 13, 2008 3:30 pm
Forum: Challenges
Topic: Didactic Long XOR challenge
Replies: 9
Views: 12460

tails wrote:guess the value of the four bytes.
So there is no relation to the other challenge mentioned except that both use XOR? :oops:
by knox
Mon Oct 13, 2008 3:01 pm
Forum: Challenges
Topic: Didactic Long XOR challenge
Replies: 9
Views: 12460

I don't exactly understand "the same cipher as in Didactic XOR 2" and how to turn it into a four-byte cipher. I have tried the answer to XOR 2, which is a word of n letters, taking the first four letters as cipher. But that didnt work. And i have tried the cipher from XOR 2, which is a sin...