Re: useless random shuffle transform URST

"houston" <housty@xxxxxxxxxxxxx> writes:
Ive come up with a simple transform that can shuffle data about and is
completely reversible no matter how many times you shuffle you can
always go back to the original format. Thing is would this ever be
useful? I suppose even after a shuffle of random bytes you still have a
random set of bytes.. but it can be preformed as small or large blocks,
so perhaps it could shuffle to something that can be compressed
further, only problem is spotting something? I think it could be
modified to allow bytes of near values to be grouped together. It
requires no sorting algorithms and is extremely fast, only thing is if
you have for example 7 bytes to shuffle it requires 7x7 array to hold
the positions.

Anyhow back to the drawing board with this one lol.

I know of no shuffling algorithm that isn't reversible.
Can you name one?

You seem to have failed to consider the size of the auxiliary
data required to make the transform reversible. Please do so,
and look up the "counting argument".

Phil
--
"Home taping is killing big business profits. We left this side blank
so you can help." -- Dead Kennedys, written upon the B-side of tapes of
/In God We Trust, Inc./.
.