Re: NSA and crypto

"David A. Scott" <daVvid_a_scott@xxxxxxxxx> wrote in message
news:Xns97C8E439640DDH110W296LC45WIN3030R@xxxxxxxxxxxxxxx
| "Ed Weir \(ComCast\)" <Anon@xxxxxxxx> wrote in
| news:AbGdnZOo37HLE_PZRVn-qg@xxxxxxxxxxx:
|
| > {snipped]
| >
| > So, David - where are your test results? I really would like to see
| > them.
| >
| > -- Ed.
| >
| > -----------------------------------------------------
| > My crystal ball is still in the shop after I tried to use it to see
| > when it would get out. Now it can only see backward in time...
| > -----------------------------------------------------
| >
| >
|
| If I thought it would help I would show some to you but I don't think
| you really care. The tests are very simple for many files all I did
| was to run a compression then a decompression to see if file matches.
| I then take the test file and do a decompression first followed by
| a compression to see it it gets back to the same file.
|
| The first tests for something like arb255 was every one byte file
| as a starting file then files with lots of zeros or ones then common
| test files. And then other files that have come up know and then.
|
| Many of the tests where run with varible register sizes. I use for default
| the full 64 bit state registers why use 32 or less. I also changed size
| with a mask to see the change with less then 64 bits you can change with
| very little mods to code. IN every case this last verision of arb255
| worked like I expected it to.
|
| arb255 is made up of many seqments that where tested as I developed
| it. For example the compressor actually only works with strings. So
| many thousands of strings tested for the I/O byte to string conversions
| that take place. There are many ways to bijective handle the space of
| all byte files to strings. I ended up using what I call the stability
| method of file I/O for the compression there is a porblem that a very
| short file can decompress to a very large file if the file is all ones
| or zeros. So I store the file a pusedo random way so that the string
| of all ones or zeros does not cause a massive decompression. Oh the
| massive decompression is still there it just that your more apt to
| accidently try to decompress a file of all zeroes or ones or some
| other highly structured file then the files that would casue massive
| decompression. To find such a file for the decompression porblem
| Just take any repeated string of any byte. Make millions of bytes
| long. These will compress to a very short file where some bits in
| the compressed file can stand for thousands of bits in the decompressed
| file. But to the eyes the compressed file will still look random.
| And with only a few bits changed in the front of file it will
| decompress to a totally different file much shorter in length.
| airthmetic compression is really neat.
|
|
|
|
| Look many get confuesed I am saying the code works on all files
| you can think of them either as compressed or uncompressed. And like
| any other general file compressor. Most files in the space of all
| files are random and that in general compressing random files actully
| makes them longer. Bijective compression or decompression is nothing
| more than rearangeing files with the hope that highly useful redunant
| files get susituted with shorter files. I am not going to violate
| the counting therom so please don't go there.
|
| 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"
|

That's a whole lotta verbiage (read: gobblety gook) for:
"I don't have any results or independent tests. Do it yourself."

So with but a thought I bijectively compressed your entire reply. Anyone
having done the effort to produce such results as I asked for would quickly
and gladly (eagerly, even) provide them to whoever sincerely asked for them.
At least in THIS group.

In conclusion, I would have to say that you have done only limited unit
tests without reproducibility, control data, or comparative results. As a
result you have only hobby code which few if any will ever download or use.
As for myself, without seeing your test results I will have to conclude my
interest in your work.

- Ed.

.

Relevant Pages

  • Re: NSA and crypto
    ... David - where are your test results? ... was to run a compression then a decompression to see if file matches. ... For example the compressor actually only works with strings. ...
    (sci.crypt)
  • Re: [RFC] LZO de/compression support - take 6
    ... Compression: 42.4646 usec ... Decompression: 42.4646 usec ... early finish compressed data buffer to less than the full size ...
    (Linux-Kernel)
  • Re: + 1E + -1E = 0E
    ... >>> energy either, ... >>> If a sound wave is a state of compression and decompression in air and ... than atoms in a low energy region. ...
    (sci.physics.relativity)
  • Re: A basic cryptanalysis question
    ... >> keys. ... >> the above is for bijective file compression. ... unique bitstream weather doing compression or decompression. ... based on second order english. ...
    (sci.crypt)
  • Re: Compression identical to its inverse?
    ... Show a compression algorithm that is *identical* ... to its corresponding decompression algorithm. ... the final bit-coding stage in a compression system). ... Well since every file has a bijective mapping to all strings ...
    (comp.compression)
Loading