Re: Compression and crypto

tomstdenis@xxxxxxxxx wrote in
news:1148586755.806215.235740@xxxxxxxxxxxxxxxxxxxxxxxxxxxx:


You never proved that. You said you could get millions of ASCII
messages. ASCII != english. I want you to show me a PRNG that can
decrypt a one byte message into millions of valid, gramatically correct
English messages.

Until you can show me that you're claims of resistance are false.



Show me were I said the above in this thread. You can't because
I never stated the above. But as usually you most likely know what
I said was true and that your wrong so you attempt to change it.
I stated that a one byte file could be easily decrypted using BICOM to
millions of files and to show the concept take a few hundred using
random keys and eack time decrpt the one byte file using BICOM you will
get easily more than 256 files.Each of which can be encrpted back
to oringnal

Now if you add my english bijective stuff with it each message file would
be in the form of a possible message most may not make sense. But many will
make pharses some with abbrevations. All will be of the following form
tok1 space tok2 space .. tokn
Where only a single space between possible tokends and and each token
be one or more cahracter of the 26 letter english alphabet. You may not
like this at least I use spaces. If one invents a QC computer to test
all the keys at once having several possilbe valid solutions would
not bode well for finding the message encrypted.

Heres a question I don't know abut AES I dought you know either but
DW seems to be following this thread. Say I have a 16 byte buffer
and its some fixed value. I try to decrypted it using AES or RIJNDAEL
so that its it decrypts the 16 byte block. Using all the different
keys for this block how many different result would there be. Would
you say 2**256 or 2**128 2**32 or what. I suspect a decent cipher
worth its salt would get at least 2**127 but Who knows what AES would
get. Actually DW may not anwser this does any one here know the anwser.
Or is the question unknown. Surely there has to be some floor value
find when the cipher was tested.

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"

.

Relevant Pages

  • Re: Compression and crypto
    ... Once you decrypt with some some random key. ... You have yet to produce a valid decompressor that produces sensible, ... english message I encrypted. ...
    (sci.crypt)
  • Re: ciphertext
    ... and the algorithm I have learned from my course is ... then use it to decrypt the ciphertext... ... > Assuming that the text is written in English, why don't you look for stuff ...
    (comp.security.misc)
  • Re: Is this a cypher?
    ... then you have few chances to decrypt it...it's AES ... encrypted, converted to english words... ...
    (sci.crypt)
  • Re: Is it this English Text?
    ... more than twos months i am trying to decrypt this text and i can't... ... the big problem is that IC is very big 0.109 where English text is ...
    (sci.crypt)
  • Re: Unicode Support
    ... consider:)...but, you know, a file is still just a "stream of characters" ... "escape sequence" but accessing an ordinary ASCII character) are considered ... English, while all your identifiers are in "Romanji" Japanese or something ... NASM appears already to do so with strings and comments in ...
    (alt.lang.asm)