Some thoughts as a follow-up to the latest news on the project status.

I think it is a safe assumption that everyone here is interested seeing 
a A5 break. And hope that small setbacks won't discourage participants.

But I think this would be a good time to take a break and discuss the 
approach that is being taken, as I think there are still some serious 
issues that needs to be addressed. What I have in mind is the size of 
the tables, and the unreasonable requirements that these place on the 
participants of the project. The way things are now, participants need 
to make the tables available online for a long long time after they have 
been computed. This is not something I am interested in. I can write 
code, use my GFX card to heat the house in winter, but I want to move on 
to other projects when I am 'done' ... this project doesn't really have 
an end in sight.

An alternative way of accomplishing the project goals could be 
(suggestion only):

Change the distinguishing points to 32 bits - and reduce chain length to 
1 (don't do rainbow tables). My high end ATI card could complete one of 
these mega single link chains every 30 seconds.

With this approach, the completed table would be less than 20 Gb - and 
it would be feasible to distribute it as a torrent. Making the table 
easily available long after it has been completed.

Admittedly it would take much longer to recover (crack) a key with this 
table. Maybe around 1 hour on a single CPU thread, but this needs to be 
done quicker, it could also be parallelized, for multiple conversations 
using the GPU. Also the entire process can be done off line.

Also remember that this approach is probabilistic, and keys can be found 
with only a fraction of the table completed. Depending on how much known 
plaintext there is in the GSM transmission, fewer chains need to be 
caclulated. If for instance the stated goal with the project would be to 
have 5% coverage - and the finished table should be around the size of a 
HD movie torrent (10-20 Gb) -  28 bits distinguishing points would 
suffice, with the added benefit of speeding up the actual cracking to a 
few minutes of computation. For instance an ATI Radeon HD 5850 card 
could do compute the entire table in ~165 years of computing.

Also to increase the number of participants, we need to identify who 
they are, and package the software in a way that makes it easy for them. 
For example if we want gamers to help, the software should be a simple 
Windows application that installs and runs with a few mouse clicks. 
Stats on who has computed the most chains is essential to boost their 
egos, etc...

- my opinions, and advice. Remember free advice is worth exactly what 
you paid for it :-)

cheers,

  Frank A. Stevenson

_______________________________________________
A51 mailing list
[email protected]
http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51

Reply via email to