home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1993 #1 / NN_1993_1.iso / spool / sci / crypt / 6406 < prev    next >
Encoding:
Text File  |  1993-01-05  |  1.1 KB  |  24 lines
  1. Newsgroups: sci.crypt
  2. Path: sparky!uunet!wupost!crcnis1.unl.edu!moe.ksu.ksu.edu!zaphod.mps.ohio-state.edu!uwm.edu!spool.mu.edu!agate!dog.ee.lbl.gov!network.ucsd.edu!qualcom.qualcomm.com!servo.qualcomm.com!karn
  3. From: karn@servo.qualcomm.com (Phil Karn)
  4. Subject: Re: Another well-intentioned novice's question
  5. Message-ID: <1993Jan5.184500.29800@qualcomm.com>
  6. Sender: news@qualcomm.com
  7. Nntp-Posting-Host: servo.qualcomm.com
  8. Organization: Qualcomm, Inc
  9. References: <1993Jan04.051300.26089@rat.csc.calpoly.edu> <cfG9faf0Bwwb4F5T9z@transarc.com> <1993Jan05.160811.29681@rchland.ibm.com>
  10. Date: Tue, 5 Jan 1993 18:45:00 GMT
  11. Lines: 11
  12.  
  13. In article <1993Jan05.160811.29681@rchland.ibm.com> lwloen@rchland.vnet.ibm.com writes:
  14. >But, an illuminating one, I think.  I claim, still, that compression should
  15. >be done as an economy-of-transmission move and not a security move, per se.
  16.  
  17. And an economy-of-CPU move too. Most compression algorithms, although
  18. somewhat CPU-intensive, are still less so than most encryption
  19. algorithms when implemented in software. So if you compress and then
  20. encrypt you may actually take many fewer cycles than if you just
  21. encrypt.
  22.  
  23. Phil
  24.