Re: A new lostless transformation algorithm

"Peter N K" <peet@xxxxxx> wrote in
news:1135856878.421806.239870@xxxxxxxxxxxxxxxxxxxxxxxxxxxx:

>
> The Main Idea: Input data is just one of the permutations of the set of
> symbols it contains.
> If you have the set (S) and the permtation number (P) you can recreate
> original permutation. The set could be coded by coding any permutation.
> When decoding takes place you shoud only rearrnge the set (S) in a such
> way that it forms (P)
>
>

Actually this is exactly what bijective arithmetic does at its best
does. For a given set of symbols you can view the arithmetic string
as a permuation number of the set. This is why something like
arb255 will compress any permutaion of a file to the same length
give or take a byte.


David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"

.

Relevant Pages

  • Re: QI and MQ Coder: First real-life experiences
    ... > coders, such as fixed radix, mixed radix and permutation coders ... My Crypto code ... My Compression code http://bijective.dogma.net/ ...
    (comp.compression)
  • Re: AES 256 key and anti-key
    ... then there is an /N chance that another ... permutation than X, then the selection is not fully random. ... life block cipher do. ... My Crypto code ...
    (sci.crypt)