Re: Making the Ciphertext String Itself Truly Random – The Conjecture.
- From: biject <biject.bwts@xxxxxxxxx>
- Date: Sun, 12 Feb 2012 10:15:18 -0800 (PST)
On Feb 12, 10:58 am, biject <biject.b...@xxxxxxxxx> wrote:
This seems nonsense. You give me a file that you think is random
that
has NO repeats at all and make the file at least 100,000 bytes
and I will supply a program to the Globe guy and it will with out
knowing the file in advance make it at least 100 bytes shorter
I goofed again. I realized I could save at least 100 bits not bytes
and since we right in byte I will write code to save at least 13
bytes.
the 100 bits was conservative so 13 bytes saves should be ok SORRY.
sense a file known to have no repeats is not RANDOM it can be
compressed to a smaller size by a general bijective file compressor.
And yes I will supply the decompressor to.
I hope you will learn anything from this but to think such a
file is random is to not understand what random is in my estimation.
But I think this was a weakness in enigma to during WWII.
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"
.
- References:
- Prev by Date: Re: The One-Way Function.
- Next by Date: Re: Resume of “Skew Line Encryptions” Programs.
- Previous by thread: Re: Making the Ciphertext String Itself Truly Random – The Conjecture.
- Next by thread: Re: Making the Ciphertext String Itself Truly Random – The Conjecture.
- Index(es):
Relevant Pages
|
