Dear Travis,
simplification can be reduced to elimination, which is indeed
intractable in the general case (for real-sized problems). (I am
assuming that you need to simplify a big system; however if you only
want to simplify a small SBox, then brute forcing might do.). The
standard citation on
Does anyone have any references on how one would go about creating
manipulating the boolean equations that govern symmetric ciphers?
I know that most of the time ciphers describe an algorithm, often
using tables (S-boxes and E-tables) in lieu of providing equations,
and I'm wondering how one goes
Travis,
Have a look at Karnough Maps, which is a matrix Boolean algebra
reduction technique. I understand that there are more advanced
computational algorithms at this point. But, I believe that they build
off of the principle of adjacency found in a Karnough Map matrix.
Best regards,
--
Mike
