Re: Braided ciphers

From: Mok-Kong Shen (mok-kong.shen@t-online.de)
Date: 02/09/03 

From: Mok-Kong Shen <mok-kong.shen@t-online.de>
Date: Sun, 09 Feb 2003 23:29:18 +0100

AE wrote:
>

> ( a AND s ) OR ( b AND NOT s)
>
> So here is the result:
>
> A and B weak, S strong: 50% of the plaintext can be recovered
>
> for a = b the plaintext bit is known
> for a = NOT b the plaintext bit is unknown
[snip]

How does one know which bit positions correspond to
the case a=b? Does the fact that A and B are weak
allow that to be determined? Thanks.

M. K. Shen

Relevant Pages