Talk:Common Scrambling Algorithm: Difference between revisions

Revision as of 09:26, 20 October 2009

Revision as of 09:38, 20 October 2009

Line 13:

Is there any reference to this affirmations? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/85.152.200.43|85.152.200.43]] ([[User talk:85.152.200.43|talk]]) 18:36, 9 July 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

Check http://www.cdc.informatik.tu-darmstadt.de/~kwirt/csa.pdf

Check http://www.cdc.informatik.tu-darmstadt.de/~kwirt/csa.pdf <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/85.228.203.183|85.228.203.183]] ([[User talk:85.228.203.183|talk]]) 09:24, 20 October 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

Implementation in a fpga would consist of a number of parallel engines that would try to decrypt and check if the content is valid. (looking for known things like mpeg-headers etc). With 42 parallel hw-threads, that each test one key per clock-cycle, for this @ 50Mhz this would allow for a bruteforce attempt in ~1 second since on average we would expect to find the key after 2^31 tries for a 2^32 bit key.