cryptoanarchy.wiki

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

1994-07-27 - Re: XSPLIT now own ftp.wimsey.bc.ca

Header Data

From: rarachel@prism.poly.edu (Arsen Ray Arachelian)
To: berzerk@xmission.xmission.com (Berzerk)
Message Hash: e12fad9e81cc68a18fff20d4d442853fdda175b04540bd3aa9c5c8c8a9b8c2ae
Message ID: <9407271246.AA16713@prism.poly.edu>
Reply To: <Pine.3.89.9407262029.A6257-0100000@xmission>
UTC Datetime: 1994-07-27 12:59:17 UTC
Raw Date: Wed, 27 Jul 94 05:59:17 PDT

Raw message

From: rarachel@prism.poly.edu (Arsen Ray Arachelian)
Date: Wed, 27 Jul 94 05:59:17 PDT
To: berzerk@xmission.xmission.com (Berzerk)
Subject: Re: XSPLIT now own ftp.wimsey.bc.ca
In-Reply-To: <Pine.3.89.9407262029.A6257-0100000@xmission>
Message-ID: <9407271246.AA16713@prism.poly.edu>
MIME-Version: 1.0
Content-Type: text


> How about doing this with n of m?  Anyone have code?


What do you mean?  The sources are included with XSPLIT.  The algorithm is
very very simple.

For all chars in input file:
I read a character from the infile called C.
I pick a number MOD the number of files.  I call this X
SUM=0
FOR FILES=0 TO N 
 IF FILES!=X
   Pick Random Number Q
   Write Randome Number Q to File #FILES
   SUM=SUM XOR Q
NEXT FILES
 WRITE C XOR Q to File #X

What exactly did you mean by n of m?  Since at each byte the numbers are picked 
randomly, the stream which holds the XOR'ed sum is random for each character.
So none of the parties holds any more information than any of the others and
it is all useless unless all of the files are joined together.

Thread