google COPACOBANA. A brute force attack was made with this device and it needed a couple of hours. The complexity of a brute force attack is lower than that of the table generation. But still much higher than a lookup in the tables. You could do the bruteforce with a few hundred cuda nodes in a few hours also. if the brute force attack requires more than a few kbytes storage than it will probably not be very efficient on GPUs. An unoptimized brute force attack (which would be as efficient on GPUs as the table generation is) would last about as long as the table generation, so that is out of the question since you can buy a TB harddisk for 100 bucks.
as i understood this project's goal is to implement a TMTO attack . i' > m certain that there are some brute force attacks on A5.1 too . > anybody is aware of those kind of attacks implemented on GPU ? > > thanks_______________________________________________ A51 mailing > list [email protected] http://lists.lists.reflextor.com/cgi-bin/ > > mailman/listinfo/a51 ______________________________________________________ GRATIS für alle WEB.DE-Nutzer: Die maxdome Movie-FLAT! Jetzt freischalten unter http://movieflat.web.de _______________________________________________ A51 mailing list [email protected] http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51
