Article View: sci.crypt
Article #3368Re: bitwise exclusive-or
From: grove
Date: Fri, 30 Jan 1987 19:01
Date: Fri, 30 Jan 1987 19:01
22 lines
1608 bytes
1608 bytes
>
>It is very easy for an exclusive-or to fail. Too many zeroes and plain
>text is the result. Too many ones and it is inverted plain text.
>--
>Scot E. Wilcoxon Minn Ed Comp Corp {quest,dayton,meccts}!mecc!sewilco
>(612)481-3507 sewilco@MECC.COM ihnp4!meccts!mecc!sewilco
>
All of these discussions of the failure of exclusive-or depend upon the
pad of random bits to not be random. If the bits are "sufficiently"
random, the likelihood that a message of length 20 comes through with
no errors is exactly the same as the string "I killed John Lennon".
Also, the chance that the transmitted message differs from the real
message by K bits is exactly the same as the chance as the transmission
differing from "I killed John Lennon" by K bits. The only problem
arises when the decoding of the known header gives the code breaker
enough information to predict the bits of the "random" pad.
Eddie Grove
P.S. I did not kill John Lennon.
Technical Details
Message-ID:
<17121@ucbvax.BERKELEY.EDU>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!ucbvax!ernie.Berkeley.EDU!groveReferences:
<434@ethz.UUCP> <5580@brl-smoke.ARPA> <875@mecc.MECC.COM>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!ucbvax!ernie.Berkeley.EDU!grove From: grove@ernie.Berkeley.EDU.UUCP Newsgroups: sci.crypt Subject: Re: bitwise exclusive-or Message-ID: <17121@ucbvax.BERKELEY.EDU> Date: Fri, 30-Jan-87 14:01:15 EST Article-I.D.: ucbvax.17121 Posted: Fri Jan 30 14:01:15 1987 Date-Received: Sat, 31-Jan-87 07:48:04 EST References: <434@ethz.UUCP> <5580@brl-smoke.ARPA> <875@mecc.MECC.COM> Sender: usenet@ucbvax.BERKELEY.EDU Reply-To: grove@ernie.Berkeley.EDU.UUCP (Eddie Grove) Organization: University of California, Berkeley Lines: 22