🚀 go-pugleaf

In <1992Apr14.130906.15514@cs.cornell.edu> wayner@cs.cornell.edu (Peter Wayner)
said:

> I remember a discussion not too long ago about the number of logic
> gates necessary to simulate the bits of the DES S-box. Someone
> observed that the DES S-boxes are more complex than random boxes. In
> this case the measure of complexity is the number of logic gates that
> it takes to simulate the result.  Can anyone point me to a reference
> on this subject?

There's a lot of fascinating stuff in switching theory on this topic. It's used
to work out ways of implementing various digital functions in soft logic such
as PLA's and RAM. Try:

`Recent Developments in Switching Theory'
ed: A. Mukhopadhyay
AP, 1971

and

`Spectral Techniques in Digital Logic'
S. L. Hurst, D. M. Miller and J. C. Muzio
AP, 1985

I suspect that a lot of this stuff could be used in cryptanalysis if one
had the time to sit down and work it all out.

Ross Anderson