From: fnerd@smds.com (FutureNerd Steve Witham)
To: cypherpunks@toad.com
Message Hash: e961e831375962931333cfce78fc9b73d8f299c139b335aa0d2c51748b315e73
Message ID: <9305201955.AA05279@smds.com>
Reply To: N/A
UTC Datetime: 1993-05-20 19:59:13 UTC
Raw Date: Thu, 20 May 93 12:59:13 PDT
From: fnerd@smds.com (FutureNerd Steve Witham)
Date: Thu, 20 May 93 12:59:13 PDT
To: cypherpunks@toad.com
Subject: Huffman and Crypto
Message-ID: <9305201955.AA05279@smds.com>
MIME-Version: 1.0
Content-Type: text/plain
Sorry if these questions have been answered in posts I recently
deleted, but...
1) Instead of modifying Huffman coding, isn't it more sensible to
just use arithmetic coding, which is more efficient anyway, and
doesn't use fixed bit patterns?
2) I would assume there's a branch of cryptography devoted to studying
the protections or lack thereof, afforded by compression schemes, both
by themselves and in addition to other types of cryptography. I would
guess that Huffman and LZ-family codes have been studied a lot...right??
But also more general studies of the weakness of (even secret)
compression algorithms as crypto methods? I mean, compression methods
would tend to use methods (like table lookup) that simpler cyphers
have used for a long time, only without having been designed with
crypto expertise...right??
3) Does anyone know of an easy-to-get-sources, easy-to-use arithmetic
coding compression program?
quote me
-fnerd
Return to May 1993
Return to “fnerd@smds.com (FutureNerd Steve Witham)”