[5442] in cryptography@c2.net mail archive
restance to linear cryptanalysis
daemon@ATHENA.MIT.EDU (staym@accessdata.com)
Sat Aug 21 23:01:31 1999
From: staym@accessdata.com
Date: Fri, 20 Aug 1999 13:46:00 -0600
To: cryptography@c2.net
With N key bits, there are 2^N different subsets of key bits. If you
fix a plaintext, then each ciphertext bit is an N-to-1 boolean
function. Is there any way to show that there is no subset of key bits
whose parity is a good linear approximation of the function?
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:staym@accessdata.com
