Re: Compression leads to encryption NEW COMPRESSION METHOD!


OK, I'll bite.

Can you please present a simple pseudo code example of your alorithm?

I looked at your PPT and it is not clear. People in this group generally
only help you if you make it easier for them.

Looking at your PPT, it seems you have a simple substitution system inplace.
But that can't really work - so either:
a) it doesn't work
b) I don't understand your notes and need pseudo code

JLC

Einstein <michaelhh@xxxxxxxxx> wrote:
Compression White Paper #5

Lossless compression by Michael Harrington.

I have created a means to compress random binary data. It involves 8
main stages, and a half dozen or so minor stages. It incorporates a
revolutionary new means to use data in computer language format, and
this is the key to its success.


Stage one is a simple means to alter the odds of occurrence in a binary
sequence. Using a old Shannon-Fano type like layout it creates a 40%
occurrence of 1's to 60% of 0's statistically. This does come at a
small size increase.

Stage two involves a complex means to identify the most likely to occur
in a 16 bit sequence, and replace it with the most compressible (via my
methods) of a 16 bit sequence.

Stage three involves using a simple 1 bit switch to tell us the
sequence is in the best ? of the 16 bits, or the worst ? of the 16
bits. The switch is temporarily stored elsewhere. If it is in the worst
16 bits group it is further switched with the best 16 bit sequence in
proper order.

Stage four involves a new method utterly of making three distinct code
groups out of the one. The first code group is where 25% of the savings
occurs. More on that later. The other two code groups are 'clones'
almost and between them we see the remaining 75% of the savings. Here
we use a simple 2 bit conversion that gives us a significant amount of
'play' with our now severely altered odds of occurrence (0's
occur so much more in this sequence at this stage, off of random binary
data, than 1's that it is laughable).


Stage five takes the 4 types of saved data, and formats two of them a
little further, resulting in the savings for the 25% area, and a means
to adequately monitor the whole.



Net result on random binary data: 82% (rounded up) of the original
size.


However to achieve this compression ratio we had to use every iteration
of 16 bits from the onset. So in this case it's approximately 1 mb of
size getting compressed. In theory it can go as low as about 10 kb and
still get 5 to 8 cycles before we can no longer compress, but this can
be on previously compressed data. However this should be explained the
smaller the file gets, the less likely it will compress, as per a bell
curve. It is possible to get a file as low as 10 bytes, but in practice
this would be time consuming and not worth attempting (the number of
repetitions required, and the number of alterations in the codes layout
via 'cycling' which ones are altered in stage #1 would get
extreme). However this works in reverse as well. It IS possible to get
the entire worlds knowledge on a DVD. I don't want to be around for
the time/processing power it would take to do this, but it is possible.



My website covers more details
http://www.security1.free2host.net/Compress/compressstart.php<


Additional notes: It should be possible to use this method with
existing encryption techniques to make literally unbreakable
encryption. No chance of the NSA decrypting the data before our sun
explodes regardless of the time span, at cost of a common word.

This paper is Copyrighted, permission to use as a news artical is
granted as is the right to have it posted on The Data Compression News
Blog. All other rights reserved Coyright April 10th 2006


--
.

Relevant Pages

  • Re: Probability, compressible sequences: Backgrounds
    ... noise is caused simply because people do not use adequate definitions ... A "specific sequence" cannot be random. ... How can you compress a specific sequence wthin the decompressor to ... external trigger (me, dropping the coin). ...
    (comp.compression)
  • Re: Transition Timing Delays
    ... PPT 2007 defaults to 200 ppi for its compression. ... Echo http://www.echosvoice.com ... Compress Pix tool is on the Picture toolbar in PPT 2003. ...
    (microsoft.public.powerpoint)
  • Re: Probability, compressible sequences: Backgrounds
    ... In the compressed sequence you need to insert also the decompressor ... How can you compress a specific sequence wthin the decompressor to ... I'm not using the coin experiment to define what a random process is. ... the only reason why we use compressors is that we model data ...
    (comp.compression)
  • Re: Bug? - Compress picture in PowerPoint 2007...
    ... PPT -- which means that when you save the file the first time, ... compress pictures is well hidden in 2003 ... Fixing PowerPoint Annoyances http://www.oreilly.com/catalog/powerpointannoy/ ...
    (microsoft.public.powerpoint)
  • Re: Transition Timing Delays
    ... PPT 2007 defaults to 200 ppi for its compression. ... Fixing PowerPoint Annoyances http://tinyurl.com/36grcd ... Compress Pix tool is on the Picture toolbar in PPT 2003. ...
    (microsoft.public.powerpoint)
Quantcast