Data compression using prime numbers
always compress random data sets by more than 50%


That's impossible. You can't compress random data, you need some structure to take advantage of. Compression must be reversible, so you can't possibly compress everything by 50% because there are far less strings of length $n/2$ than there are of length $n$.

There are some major issues with the paper:


They use 10 test files without any indication of their content. Is the data really random? How were they generated?
They claim to achieve compression ratios of at least 50%, while their test data shows they achieve at most 50%.



  This algorithm defines a lossless strategy which makes use of the prime numbers present in the decimal number
  system



What? Prime numbers are prime numbers regardless of the base.
Issue #1 with decompression: prime factorization is a hard problem, how do they do it efficiently?
Issue #2 with decompression (this is the kicker): they multiply the prime numbers together, but doing so you lose any information about the order, since $2\cdot 5 = 10 = 5\cdot 2$. I don't think it is possible to decompress at all using their technique.


I don't think this paper is very good.