Re: Please answer these questions on decryption of modern ciphers

"kentucky" <pam@xxxxxxxxxxxx> wrote in
news:44a11471$0$12393$afc38c87@xxxxxxxxxxxxxxxxxxxx:


Given:
p is the true and unknown plaintext - (assume ASCII).
k is the true key.
c is the related cipher text generated by c = E(p, k)



The fact that the message was straight ASCII allowed
this to occur. If the message had been bijectively
compressed and whitened then they would not have been
successful. Its one of the reasons you should compress
whiten then encrypt.

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: Data-compression puzzle - why cant files be repeatedly compressed until theyre only 1 by
    ... define a symbol set that can represent the data you wish to ... Take the string you wish to compress: ... Use the mapping to convert this to a number (with ASCII, ... Simply measure the distance from the notch to ...
    (rec.puzzles)
  • How do you explain?
    ... I assumed that these were candidate keys that gave ASCII looking results. ... When Ki approximates the true key with greater than ... There is no such thing as an "approximation" to a key. ... for any correctly designed cipher. ...
    (sci.crypt)