Java Security

Hi all,
I am trying different methods to break xor encryption algorithm. There are various softwares available. One of them is xor-analyse
This works as follows:
To find out what length the password is the ciphertext is XOR-ed
against itself with different shifts (see XOR_analyze::coincidence()
in analyze.cc) and the number of zeroes (equal bytes) are
counted. This is called counting coincidences. When the number of
zeroes is high the shift value is potentially a multiple of the key
length. The one that stands out most is checked with statistics (with
a frequency table) to get the key. To check with statistics on all
key-lengths in key-length interval (-m and -M) use the -a switch (with
-v for one key per keylength).

when i run this the statistics doesnt seem to be true and it wont give proper keylenth. I used p0.freq and linux-2.2.14-int-m0.freq separately
but this aint working.
Is there anyother way to use in in a proper way.
Correct me if im wrong.

I have wrote my own c++ code to break the xor encryption but again its not bug free... you have to use brute force but doesnt work for some keylengths.
I have used Kappa function as a base for my code.

Is ther anything available in java also...
please let me know if anyother free software is available...


Thanks,
Mahendra Ghuge