From: “Mark Grant, M.A. (Oxon)” <mark@unicorn.com>
To: Mutant Rob <wlkngowl@unix.asb.com>
Message Hash: 1a9fc97307574f19759418cbcafc25bd86f0a5475337c787c955a91619448942
Message ID: <Pine.3.89.9603021534.A24537-0100000@unicorn.com>
Reply To: N/A
UTC Datetime: 1996-03-03 00:07:04 UTC
Raw Date: Sun, 3 Mar 1996 08:07:04 +0800
From: "Mark Grant, M.A. (Oxon)" <mark@unicorn.com>
Date: Sun, 3 Mar 1996 08:07:04 +0800
To: Mutant Rob <wlkngowl@unix.asb.com>
Subject: Re: Is there any work on entropy-lowering schemes?
Message-ID: <Pine.3.89.9603021534.A24537-0100000@unicorn.com>
MIME-Version: 1.0
Content-Type: text/plain
On Fri, 1 Mar 1996, Mutant Rob wrote:
>So it seems possible to create a scheme that given a key will take a
>block of n bits and expand it to 1.5n or 2n bits, recoding it in such
>a way that determining the key is difficult even if one suspects such
>a scheme has been used... but that using the scheme will make the data
>look more like the MSBs of graphical data rather than encrypted data.
Stealth 1.3 (or is it 1.2?) does that, but it only makes the data look
more like the MSBs, and not *exactly* like the MSBs. I think it's available
from Adam Back's WWW site (http://dcs.ex.ac.uk/~aba/stealth/).
Mark
Return to March 1996
Return to ““Mark Grant, M.A. (Oxon)” <mark@unicorn.com>”
1996-03-03 (Sun, 3 Mar 1996 08:07:04 +0800) - Re: Is there any work on entropy-lowering schemes? - “Mark Grant, M.A. (Oxon)” <mark@unicorn.com>