cryptoanarchy.wiki

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

1994-07-04 - obscurity is security (was Re: Logical Depth

Header Data

From: Roger Bryner <bryner@atlas.chem.utah.edu>
To: N/A
Message Hash: daa2cc3466eb26882ac5a26cae5e68ec240d0bc4bbfb9a39c47ed68888694d5d
Message ID: <Pine.3.89.9407041224.A6765-0100000@atlas.chem.utah.edu>
Reply To: <199407041744.KAA08649@netcom5.netcom.com>
UTC Datetime: 1994-07-04 19:58:06 UTC
Raw Date: Mon, 4 Jul 94 12:58:06 PDT

Raw message

From: Roger Bryner <bryner@atlas.chem.utah.edu>
Date: Mon, 4 Jul 94 12:58:06 PDT
Subject: obscurity is security (was Re: Logical Depth
In-Reply-To: <199407041744.KAA08649@netcom5.netcom.com>
Message-ID: <Pine.3.89.9407041224.A6765-0100000@atlas.chem.utah.edu>
MIME-Version: 1.0
Content-Type: text/plain


On Mon, 4 Jul 1994, Timothy C. May wrote:
> and iterates/crunches on it, producing this output:
> 
>               1 0 1
>             1 1 0 1 0
>           0 1 0 1 0 0 0
>         0 1 1 0 0 0 1 0 1
>       1 0 0 1 0 1 1 1 0 1 1
The ALGORITHIM also contains information.  If the ALGORITHIM is part of a 
secret key, so much the better.  To say exactly how much information an 
algorithim contains is, to say the least, formatable.  In the case of 
functions, it is simple.

Lets put the question to addition, how much entropy does + have when 
applied to bits.?

Roger, Mad Dog, Bryner.

Thread