Re: Theory of Cryptography 2004 - Preliminary Program

From: Mok-Kong Shen (mok-kong.shen_at_t-online.de)
Date: 11/06/03 

Date: Thu, 06 Nov 2003 15:57:35 +0100

"David A. Scott" wrote:
>
[snip]
> 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.

It's my impression that, in the long years, although you
have been very enthousiatic in propagating your scheme,
somehow your explanation techniques seemed (I guess) not
to be good enough (in a pedagogical sense) to attract
sufficient interest from the readers, with the further
result that there arose plenty of misunderstandings and
consequently the threads tended to be unproportionately
large and, as a secondary effect, to be more susceptible
to be filled with posts from people with less intention
to discuss scientifically than to enhance the noise/signal
ratio, thus finally leading to a fullstop of the threads
without any very clear results. Maybe you could give this
some thought and sometime later start once again a thread
on your scheme. A good and easily understandable sketch
of the scheme with pointers to carefully documented and
well commented codes (note that pure C codes are hard to
read by other people) would be desirable. (Just my 2 cents.)

M. K. Shen

Relevant Pages

  • Re: 100 megaton bombs atop Saturn V rockets
    ... >>since it could be made to work without compression. ... Super" the scheme for a self-sustaining combustion wave in uncompressed ... > Probably not, a) because fusion fuel is pretty light, and b) because ... cryotank of liquid deuterium, like the Saturn upper stage or the Shuttle ...
    (sci.space.history)
  • Re: 100 megaton bombs atop Saturn V rockets
    ... >>since it could be made to work without compression. ... Super" the scheme for a self-sustaining combustion wave in uncompressed ... > Probably not, a) because fusion fuel is pretty light, and b) because ... cryotank of liquid deuterium, like the Saturn upper stage or the Shuttle ...
    (sci.space.policy)
  • Re: 4-level image compression ?
    ... I have my doubts as to how well the coding scheme used by JPEG-LS will ... work with 2bpp images. ... scheme, but it is sounding like it is using rice-coding for the residuals. ... 2-bits per item with 2-bpp input means no compression, or worse, inflation. ...
    (comp.compression)
  • Re: Packbits implementation
    ... then repeat AB a total of N+2 times. ... which one gave the best compression. ... I did a similar scheme once that checked not successive bytes, ... the decompressor is not much more compilcated. ...
    (comp.sys.apple2.programmer)