New answers tagged

2

Slide #8 in the presentation you linked to describes the way Käsper and Schwabe pack the bits of the AES data blocks into CPU registers. According to the slide, what they're doing is processing eight 128-bit AES blocks in parallel, using eight 128-bit XMM registers to store them. They're not doing basic "naïve bitslicing", which would involve using 128 $n$-...


1

The Encryption is not likely Compression where one can choose Normal, High or Low or something from scale of 0-100 as you mentioned. If you really want to do it, you can think of it in two ways Reduce the keyspace, as already mentioned in an above answer Reduce the Rounds. But these both will lead to a situation where you may end up in a breakthrough (...


0

The image below shows the 30 irreducible polynomials for GF2^8. As an interesting factor it seems that 16 out of 30 has Hamming Weight of 4 (ignoring the MSB i.e x^8) and more interestingly 7 out of these 16 (with Hamming Weight 4) has nibble wise balanced Hamming Weight. Twofish m(x) is on of the nibble wise balanced. One more beauty you will find in it ...



Top 50 recent answers are included