A comparative performance analysis of NTRU and its variant cryptosystems

With the fast developing of computer hardware, many problems which are previously considered hard, will be solved practically. Number of theoretical problems that form the core of many public key cryptosystems are such of them. Therefore, new cryptosystems which are designed based on other mathematical techniques are of great demands. NTRU which is based on the hardness of lattice problems is one of such cryptosystems. In previous works, we designed three cryptosystems alternatives to NTRU, called HXDTRU, PQTRU, and BITRU they are based on high dimensional algebra. We proved that, they performed better than NTRU. For practical use, a comparative performance between the aforementioned cryptosystems and NTRUforms the core of this work.