1993-01-05 - Re: purloined letter

Header Data

From: wcs@anchor.ho.att.com (Bill_Stewart(HOY002)1305)
To: cypherpunks@toad.com
Message Hash: 2a0a27dc82111f117467b9538a9ae625e174c1b03b5ed8e9bd408d5b82c58812
Message ID: <9301051843.AA15785@anchor.ho.att.com>
Reply To: N/A
UTC Datetime: 1993-01-05 18:48:32 UTC
Raw Date: Tue, 5 Jan 93 10:48:32 PST

Raw message

From: wcs@anchor.ho.att.com (Bill_Stewart(HOY002)1305)
Date: Tue, 5 Jan 93 10:48:32 PST
To: cypherpunks@toad.com
Subject: Re: purloined letter
Message-ID: <9301051843.AA15785@anchor.ho.att.com>
MIME-Version: 1.0
Content-Type: text


The hiding-data-in-bogus-text system that Phil referred to is
Peter Wayner's Mimic functions, which let you represent data using
a Huffman code or context-free-grammar set of productions that
matches innocuous text.  The examples in the paper used baseball game
radio narration (hiding a message "Paul is dead" :-) and political
speeches by Mr. Neil Kinnock, the raving Labour Party honcho whose
speeches were plagiarized by Joe Biden.  (Biden, btw, was a nice guy
when he was elected to the Senate at age just-under-30,
but he's apparently gone Big Brotherish as he's aged.
I'm not bothered by one politician borrowing another's speeches,
but stooping to Neil Kinnock's syrupy ranting is a bit much :-)

The papers on the mimic functions are in ftp.cs.cornell.ecu,
under /pub/wayner/Mimic.  There are also a couple of papers on
building a highly parallel des-cracker out of content-addressable memory,

Until encryption becomes widely used, if yuo want to hide encrypted 
data, mimic functions or low-bits-of-gifs are good ways to go.

		Bill Stewart




Thread