Abstract

In this paper I have given an algorithm (my original work) named as the ‘PHNIKS Algorithm’ which can be used to encrypt-decrypt data and breaking the ciphertext is computationally infeasible which makes it much strong. I have given proofs of the above claims in this paper and computed the required results. I have also given the bruteforce attack and computed the time required to break the cipher-text assuming the highest possible speed today that is 33.86 PFLOPS of TIANHE-2 supercomputer (source of information mentioned in the references).