BITRU: Binary Version of the NTRU Public Key Cryptosystem via Binary Algebra
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 11
Abstract
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.
Authors and Affiliations
Nadia M. G. Alsaidi, Hassan R. Yassein
Keywords
Related Articles
- EP ID EP358925
- DOI 10.14569/IJACSA.2016.071101
- Views 80
- Downloads 0
Scalable Data Analytics Market Basket Model for Transactional Data Streams
Transactional data streams (TDS) are incremental in nature thus, the process of mining is complicated. Such complications arise from challenges such as infinite length, feature evolution, concept evolution and concept dr...
FRoTeMa: Fast and Robust Template Matching
Template matching is one of the most basic techniques in computer vision, where the algorithm should search for a template image T in an image to analyze I. This paper considers the rotation, scale, brightness and contra...
Recommendations for Building Adaptive Cognition-based E-Learning
Adapted e-Learning systems try to adapt the learning material based on the student’s preferences. Course authors design their courses with their students’ styles and in mind, course delivery should match the student styl...
Billing System Design Based on Internet Environment
This paper deals with the design of Internet billing system, in which it is possible pay invoices electronically. This approach is implemented via virtual banks, in which the process of money transfer can be implemented....
HappyMeter: An Automated System for Real-Time Twitter Sentiment Analysis
The paper presents HappyMeter, an automated system for real-time Twitter sentiment analysis. More than 380 million tweets consisting of nearly 30,000 words, almost 6,000 hashtags and over 5,000 user mentioned have been s...