t2 infosec conference
4Sep/09Off

t2′09 Challenge Hint #2

The key is 8 digits long. No more hints will be published as it should be now pretty straightforward to solve the first phase.

4Sep/09Off

t2′09 Challenge Stats – Friday 2009-09-04

Timo Hirvonen from Tampere, Finland was the first one to solve the t2'09 Challenge. The feat that he pulled off was absolutely amazing. Congratulations!

That being said, now the rest of the contestants should concentrate on the elegance of the answer.

So far Timo is the only one who has been able to solve phase 1 (and well rest of the phases as well :)

4Sep/09Off

t2′09 Challenge Hint #1

Based on the comments and email discussions the general opinion seemed to be that we should not reveal too much information, especially since one contestant has been able to solve the first stage without any hints.

So, here we go: it is RC4.

Next hint will be published today 22:00 EEST (GMT +03:00). The next hint will be about the key.

3Sep/09Off

t2′09 Challenge Stats – Thursday 2009-09-03

One contestant at phase 2 - Congrats! (if you are reading this please email us now - we want to know who you are :)

Although we feel that the situation has changed a bit as one contestant has been able to solve the phase 1 we still decided to proceed with the plan to publish more hints on Friday morning as we feel that it makes the Challenge more interesting.

2Sep/09Off

More t2′09 Challenge Hints Will Be Published On Friday

Many people have pointed out that there are way too many things that can be done with time and all of you are right. As the purpose of the Challenge is to be entertaining rather than annoying we will publish more hints on Friday morning 10:00 EEST (GMT +03:00).

Please be active and comment to this post how much information you would like to get on Friday. Currently we are thinking of releasing the pseudo-code for calculating the key.

2Sep/09Off

t2′09 Challenge Stats – Wednesday 2009-09-02

We are getting like couple of hundred downloads per day but still nobody at phase 2. C'mon - it is not _that_ difficult ;)