notes to self

Lets also recall the lesson of the Russian cipher comparing how the matrix transform computes an inner product whose value drives the non-linear function – in the sense that certain state bits in DES use 2 bits of an expanded 6 bits to drive the  choice of sbox.

Put this together with the rules on creating non-exceptional algebras (of the kind Turing was discussing, albeit with permutation groups). Recall from the Fano discussion how the constraints of the semi-groups comes down to a relationship between the group and its subgroups, which in binary can be expressed as a tunny-era 2-impulse delta’ing process that imposes parity – and thus defines the “right stuff”.


About home_pw

Computer Programmer who often does network administration with focus on security servers. Sometimes plays at slot machine programming.
This entry was posted in crypto. Bookmark the permalink.