obscurity is security (was Re: Logical Depth
Roger Bryner
bryner at atlas.chem.utah.edu
Mon Jul 4 12:58:06 PDT 1994
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.
More information about the cypherpunks-legacy
mailing list