Are Big S-Boxes Best?

Various probabilities of accidental linearities occurring in a random, reversible substitution lookup table (S-box) with m address and m contents bits are calculated. These probabilities decrease very dramatically with Increasing m. It is conjectured that good S-boxes may be built by choosing a random, reversible table of sufficient size.