A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure. (17th February 2022)

• Record Type: Journal Article
• Authors: Yassein, Hassan R.; Al-Saidi, Nadia M. G.; Farhan, Alaa K.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 25:Number 2(2022)
• Page Start: 523
• Page End: 542
• Publication Date: 2022-02-17
• Subjects: 11T71 -- 14G50 -- 68P25; NTRU -- QOBTRU -- Carternion algebra -- Successful decryption -- Security level; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2020.1741218
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: NTRU public key cryptosystem relies on computations that are efficiently performed with insignificant storage and time complexity. Many researchers were motivated to improve NTRU performance by replacing the original polynomial ring and mathematical structure with new modified algebraic structures, such as QTRU, OTRU, BITRU, and many others. In this work, a new NTRU-analog cryptosystem called QOBTRU is proposed based on a newly designed algebraic structure called Carternion algebra. QOBTRU is at least quadratic higher than the original NTRU in terms of computational and space complexity. It is intended to have an alternative security and performance attribute upon three chosen highly performed multidimensional NTRU-like cryptosystems, which are QTRU, OTRU, and BITRU. Their comparison with QOBTRU highlighted its strength over them. Some statistical and security analysis is performed to demonstrate its efficiency.