BITRU: Binary Version of the NTRU Public Key Cryptosystem via Binary Algebra

New terms such as closest vector problem (CVP) and the shortest vector problem (SVP), which have been illustrated as NP-hard problem, emerged, leading to a new hope for designing public key cryptosystem based on certain lattice hardness. A new cryptosystem called NTRU is proven computationally efficient and it can be implemented with low cost. With these characteristics, NTRU possesses advantage over others system that rely on number-theoretical problem in a finite field (e.g. integer factorization problem or discrete logarithm problem). These advantages make NTRU a good choice for many applications. After the adaptation of NTRU, many attempts to generalize its algebraic structure have appeared. In this study, a new variant of the NTRU public key cryptosystem called BITRU is proposed. BITRU is based on a new algebraic structure used as an alternative to NTRU-mathematical structure called binary algebra. This commutative and associative. Establishing two public keys in the proposed system has distinguished it from NTRU and those similar to NTRU cryptosystems. This new structure helps to increase the security and complexity of BITRU. The clauses of BITRU, which include key generation, encryption, decryption, and decryption failure, are explained in details. Its suitability of the proposed system is proven and its security is demonstrated by comparing it with NTRU.

[1]  Shenghui Su,et al.  An Improvement and a New Design of Algorithms for Seeking the Inverse of an NTRU Polynomial , 2011, 2011 Seventh International Conference on Computational Intelligence and Security.

[2]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[3]  Zuohua Ding,et al.  A Public-Key Cryptosystem Based On , 2014 .

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[6]  Joseph H. Silverman,et al.  NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.

[7]  Nitin Vats.  NNRU, a noncommutative analogue of NTRU , 2009, ArXiv.

[8]  Praveen Gauravaram,et al.  Analytical study of implementation issues of NTRU , 2014, 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[9]  Bok-Min Goi,et al.  MaTRU: A New NTRU-Based Cryptosystem , 2005, INDOCRYPT.

[10]  Yingpu Deng,et al.  A General NTRU-Like Framework for Constructing Lattice-Based Public-Key Cryptosystems , 2011, WISA.

[11]  Alessandro Piva,et al.  Cryptography and Data Hiding for Media Security , 2008 .

[12]  Ali Zakerolhosseini,et al.  OTRU: A non-associative and high speed public key cryptosystem , 2010, 2010 15th CSI International Symposium on Computer Architecture and Digital Systems.

[13]  Patrick Solé,et al.  CTRU, a polynomial analogue of NTRU , 2002 .

[14]  Ahmad T. Sadiq,et al.  An improved NTRU Cryptosystem via Commutative Quaternions Algebra , 2015 .

[15]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[16]  Monica Nevins,et al.  ETRU: NTRU over the Eisenstein integers , 2013, Designs, Codes and Cryptography.

[17]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[18]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .