A Pairity Cracking Algorithm

From: Douglas Eagleson (eaglesondouglas_at_yahoo.com)
Date: 06/29/05 

Date: 29 Jun 2005 13:17:00 -0700

A Pairity Cracking Algorithm
Douglas Eagleson, 2005

A single algorithm of code
may implement this relation.

********************************
a- as a binary symbol set
b- as a binary symbol set
for every a,
a set shuffle change
difference
xor b
********************************
Place the binary "a's" in memory locations.

At memory locations for the "a's", alter the
state. And the variable is a certain
"a" element itself. Meaning the common
set symbol appears always the transformation
constant. So select from the "a" set symbols sequentially
and perform this entire set test "a" times.
An element change by the constant, means
a simple symbol's replacement for each
location by set shuffling. Shuffle memory
contents, the constant's integer magnitude times.
Even though the shuffle will repeat itself
as a set state, the state of this algorithm
will be unique. And the shuffle is
a set state type where the reader needs
to replace with the abstract location.

Difference means a binary state is
subtracted from every set element.
And the applied constant is used once more.
A simple binary subtraction with a rollover.

xor the memory "a's" locations to the
variable "b's" locations. Test for legibility.
Replace the memory location for set "b" to
the "a" set location and repeat using the
original constant.

note: An alphabet's effect in relation to
any symbol set allows the searching by the
above algorithm. A nice sized
search is the outcome. And the relation
removed is the applied pairity.