Article View: sci.crypt
Article #2915Compression and Randomization == Encryption
From: Robert Lewis Glendenning
Date: Thu, 07 Jan 1993 04:59
Date: Thu, 07 Jan 1993 04:59
22 lines
1436 bytes
1436 bytes
Yes, compression software provides clues just the same as standard headers. However, compression also reduces redundancy. I believe that Shannon's Information Theory implies that a signal with no redundancy is uncrackable. So, if you merely randomize the order of the compressed bytes, the difficulty of cracking it should be an exponential order of the length of the message. If you want to make sure, and for short messages, add some random stuff. Then the cracker has the problem of separating the signal from the noise, ordering it, and then (the easy part) decompressing it. I keep wondering why this appraoch isn't intellectually respectable. At minor computational cost and selectable increase in comm costs, it appears that you can have a vast increase in security, including resistance to cracking traffic beginning with common headers, etc. I guess I am a novice also, because I don't appear to understand either. Lew -- Lew Glendenning rlglende@netcom.com "Perspective is worth 80 IQ points." Nils Bohr (or somebody like that).
Technical Details
Message-ID:
<1993Jan7.045921.18680@netcom.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!wupost!csus.edu!netcom.com!rlglendeShow Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!wupost!csus.edu!netcom.com!rlglende From: rlglende@netcom.com (Robert Lewis Glendenning) Subject: Compression and Randomization == Encryption Message-ID: <1993Jan7.045921.18680@netcom.com> Organization: Netcom Online Communications Services (408-241-9760 login: guest) Date: Thu, 7 Jan 1993 04:59:21 GMT Lines: 22