Hassan Yassein

Mr. Hassan Yassein


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2020 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
HYHassan Yassein
Hassan Yassein
NANadia Mohammed Ghanim Al-Saidi
Nadia Mohammed Ghanim Al-Saidi
Alaa kadhim FarhanAlaa kadhim Farhan
Alaa kadhim Farhan
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.

1 September 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
HAH.H. Abo-Alsood
H.H. Abo-Alsood
HYHassan Yassein
Hassan Yassein
NTRU is an open-source public key cryptosystem that encrypts and decrypts data using lattice-based cryptography. It is more resistant to attacks than other common public-key cryptosystems, and its performance has been demonstrated to be significantly higher. Any cryptosystem that uses non-commutative computations in its encryption and decryption processes becomes a highly lattice attack-resistant system as a result of Shamir’s conclusion. This paper presents a new multidimensional public-key cryptosystem which is a non-commutative variant of the NTRU called QOTRU. It operates in the subalgebra of octonion algebra called Qu-octonion subalgebra with a new mathematical structure of two public keys and five private keys. This new structure has enhanced the public key system to be more secure and complex.

1 September 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
SSS H Shahhadi
S H Shahhadi
HYHassan Yassein
Hassan Yassein
Since cryptography relied on mathematical theories and applications of computer science, mathematical algorithms are built with high difficulty. In this paper, we make an improvement and modification NTRU cryptosystem called NTRSH by using a new tripternion algebra and changing the mathematical structure for public and private keys, as well as for text encryption and decryption to obtain more and higher security.

1 April 2017
Verified
Conference Paper
Closed access
HYHassan Yassein
Hassan Yassein
NANadia Mohammed Ghanim Al-Saidi
Nadia Mohammed Ghanim Al-Saidi
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.

1 January 2025 in International Journal of Mathematics and Computer Science
Verified
Journal Article
Closed access
SASahab Abboud
Sahab Abboud
RARuma Kareem K. Ajeena
Ruma Kareem K. Ajeena
HYHassan Yassein
Hassan Yassein
In this paper, we design a new version of the RSA public key cryptosystem which utilizes the octonion polynomials that are elements of an octonion algebra with eight-dimensions. In the proposed version, which is called OP-RSA cryptosystem, the keys are created as the octonion polynomials. The plaintext is chosen as an octonion polynomial and the ciphertext for it is an element in an octonion algebra (OA) which is an octonion polynomial as well. The decryption process is proved mathematically based on the octonion polynomials. The security issues are determined. The proposed OP-RSA cryptosystem is more secure in comparison with other presented versions.

1 January 2025 in International Journal of Mathematics and Computer Science
Verified
Journal Article
Closed access
FAFatimah Albakaa
Fatimah Albakaa
HYHassan Yassein
Hassan Yassein
In this paper, we develop a new method of encryption, using DNA and polynomials as public and private keys, which gives a very high level of security for both the private keys and the original message.