From: bob hope Date: 2012-08-01T17:56:21+09:00 Subject: Re: working with large binary strings? Thanks for the tips. It is a simple PIR, here is a paragraph about it if you happened to be curious, thanks for your help you have answered all of my questions :) "The client sends a different “random-looking” bit vector vsb to each distributor s, for each bucket b to be retrieved. Each bit vector has a length equal to the number of buckets in the pool. Each distributor s then computes R(vsb ) as the XOR of all buckets whose positions is set to 1 in vsb . The resulting value is then returned to the client. Thus, in order to retrieve the b’th bucket, the client need only to choose the values of vsb so that their exclusive OR is 0 at every position except b. (For security, k−1 of the vectors should be generated randomly.) When the client receives the corresponding R(vsb ) values, she can XOR them to compute the bucket’s contents." Yes yes home rolled encryption is horrible but this is so simple that I don't think even I can screw it up .. and I am in contact the person who designed it and they will tell me if I screwed it up when I am done with it I appreciate your advice, I am pretty sure I can do it correctly but efficiently is where I am sure to screw up :P -- Posted via http://www.ruby-forum.com/.