cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1994-03-01 - Re: standard for stegonography?

Header Data

From: Jeremy Cooper <jeremy@crl.com>
To: Sergey Goldgaber <sergey@delbruck.pharm.sunysb.edu>
Message Hash: 212681b5fd47db8f95f51d9c8ebc2e33dc2c4fb916569aad3e9af8b6e6a02f0f
Message ID: <Pine.3.87.9402282231.A8890-0100000@crl.crl.com>
Reply To: <Pine.3.89.9402281853.A11533-0100000@delbruck.pharm.sunysb.edu>
UTC Datetime: 1994-03-01 06:38:25 UTC
Raw Date: Mon, 28 Feb 94 22:38:25 PST

Raw message

From: Jeremy Cooper <jeremy@crl.com>
Date: Mon, 28 Feb 94 22:38:25 PST
To: Sergey Goldgaber <sergey@delbruck.pharm.sunysb.edu>
Subject: Re: standard for stegonography?
In-Reply-To: <Pine.3.89.9402281853.A11533-0100000@delbruck.pharm.sunysb.edu>
Message-ID: <Pine.3.87.9402282231.A8890-0100000@crl.crl.com>
MIME-Version: 1.0
Content-Type: text/plain



> 
> "Pseudo-Stego" can be relatively secure as long as a large number of 
> different hiding schemes/standards are used by the public.  An effective 
> means of ensuring this would be to use the reciever's public-key 
> checksum-value as the standard offset for stego.  The large number of 
> public-keys available make it rather infeasable for one's opponents to try 
> them all.  This, I believe, provides pretty adequate security (assuming one 
> strips any telltale headers off the hidden file beforehand).
>

How many possible checksums are there?  If you use a one byte checksum, 
there are only 256 possible combinations right?  Maybe what I am asking 
is, 'How big is the checksum?' 
                   _  .  _ ___ _  .  _
===-|)/\\/|V|/\/\ (_)/_\|_|\_/(_)/_\|_| Stop by for an excursion into the-===
===-|)||| | |\/\/  mud.crl.com 8888 (_) Virtual Bay Area!                -===

Thread