Talk:Common Scrambling Algorithm: Difference between revisions

Revision as of 00:38, 23 March 2008

Revision as of 18:36, 9 July 2009

Line 3:

Can anybody reference where to find the information about bytes 3 and 7 being checksums or if you could explain how to calculate them. - Aldebarn42

: Byte form AA BB CC xx DD EE FF yy -- xx and yy are checksums, xx=AA+BB+CC, yy=DD+EE+FF. I suspect this is in the BISS specification somewhere. So that's bytes 3 and 7 when starting count at 0. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/87.194.114.122|87.194.114.122]] ([[User talk:87.194.114.122|talk]]) 00:36, 23 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

The entry says:

<blockquote>

This fact allows practical space-time tradeoff attack where 32 bits are brute-forced, 16 bits are calculated with memory tables built from ciphertext, and 16 bits calculated as checksum with a running time of O(216)+O(232), which can be less than a second if implemented in FPGA hardware or on scalable architecture like cell processor.

</blockquote>

Is there any reference to this affirmations?