Re: Theory of Cryptography 2004 - Preliminary Program

From: David A. Scott (daVvid_a_scott_at_email.com)
Date: 11/06/03 

Date: 6 Nov 2003 14:17:33 GMT

Mok-Kong Shen <mok-kong.shen@t-online.de> wrote in
news:3FAA5337.5E998C08@t-online.de:

>
> I would also like to know more on compression schemes
> that are 'dependent' on some keys. (This was a bit
> touched upon in past discussions a while back.)
>
>

   I suspose about the simplist keyed compression
schemes is do a bijective adaptive huffman but you change
the 1 0 patterns used as the tree is built using a key
to drive the changes. You could have an IV with it
buy allowing for a certain number of ramdom symbols to
be used as it starts. You could do something very simialar
with a bijective arithmic compress that would be orders of
magnitude harder to break. This has all been covered before.

   But if you do something like above while doing a type
of BWT compression it would be much harder to break
exmple. Do my kind of BWT where pointer added by DSC
then my style MTF then do my matching RLE but just before
you get to arthimetic last stage do a random rotation of file
then do the keyed arithmetic. They will not discuss this
kind of encryption in this group and I think you know that.

David A. Scott 

-- 
My Crypto code
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott19u.zip
http://cryptography.org/cgi-bin/crypto.cgi/Misc/scott16u.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
Quantcast