[devnulloverflow]

While I generally thing that looking for practical applications of research is nonsense, this one seems to be in an obviously useful area.

It's all about different ways of measuring how good a function is at scrambling the input data. I'm guessing if you want to break (or make) a hash or cryptosystem you will use these measures over various aspects of it to look for weaknesses or some such.

This particular proof seems to be saying that the measure called sensitivity will give you similar answer to a bunch of other measures.

On the one hand, that's disappointing (a measure that gave totally different results might enlighten whole new ways of attacking/strengthening you crypto). On the other hand it is encouraging because if a whole bunch of very different measures agree, then that's a sign that they are on to something real.