A Parity Cracking Implementation

Here is a demonstration implementation of a true parity shuffle as a
cracker program. It basically demonstrates the misapplied term, key.
Here the key is just a shuffle initial state. And the constant "limit"
becomes the state.

It is written as a parody to the mistaken security of modern byte
algorithms. As a rule always,always bit state the algorithm.

It needs minor changes to alter from demonstration to actual cracking
usage.

Douglas Eagleson
Gaitherbsurg, MD USA

[UUdata c code]
Received on Mon Oct 17 20:48:19 2005