XOR does one thing and one thing only. It takes a seed value and XOR's it with the datum (be it a byte, word, etc). Once you have the value that was XOR'ed with the data, you've broken that ciphertext no matter the length of the original key.

Now by random, in your statement above, I assume you mean a random value for each datum being encrypted? Datum, in this case, being a pre-chosen length of 1's and 0's that the "encryption algorithm" uses. If that is so, how would the key be transmitted? The other side of the transmission would need to know it, and if it works like PK, then you no longer are using simple XOR. I haven't seen any "Public Key XOR" algorithms out there. As well, what generates the "seed values"? Does it a have a predictable pattern? If so, then it can be cracked.

XOR is not used primarily because it *can* be broken so easily. Saying it would be impossible to crack just because of key length is a bit short-sighted since, if it were that good, we'd have no need of any other encryption. In any event, cryptanalysis is getting better and better all the time so key lengths really don't mean much.

nc -L -v -p 5000 -w 5 > out.txt

Sending computer:

nc localhost 5000 -w 5 < sfasd.txt

great tutorial