TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

HH-MRSA : Designing an improvement of MRSA with high security

* , , , ,

* Corresponding author · click or hover a name for details

pp. 557–564Vol. 28Issue 2March 2025DOI: 10.47974/JDMSC-2255 Crossmark XML
Received:
05 Nov 2024
Published Online:
11 Apr 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2255
Pages:
557–564

Abstract

Modern technology has become a means of exchanging data but at the same time it helps hackers to access the data exchanged over the Internet, and the development of encryption techniques and ways to enhance security has become necessary to avoid such breaches. In this work, we have introduced a new system to improve MRSA using HH-Real algebra in the mathematical construction of the method, which gave a high level of security to its phases.

Keywords

Subject Classifications

94A60

References

[1] R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120-126 (1978), [Online]. Available: https://doi.org/10.1145/359340.359342.
[2] J. Hoffstein, J. Pipher, and J.H. Silverman, “NTRU: A ring-based public key cryptosystem,” Lecture Notes in Computer Science, vol. 1423, pp. 267-288 (1998), [Online]. Available: https://doi.org/10.1007/bfb0054868.
[3] B.P.U. lvy, P. Mandiwa and M. Kumar, A modified RSA cryptosystem based on “n “ prime numbers, Int. J. Comput. Sci. Eng, vol. 06, no. 03, pp. 78-90 (2018), [Online]. Available: https://doi.org/10.4236/jcc.2018.63006.
[4] I. B. Gafitoiu, Polynomial based RSA, B. Sc, Linnaeus University, Sweden, (2015). 
[5] E. Malecian, A. Zakerolhosseini, OTRU: A non-associative and high-speed public key cryptosystem, Proceeding of the 15th CSI international symposium on computer architecture and digital systems, 83-90 (2010).
[6] H.R. Yassein and N. M. Al- Saidi, HXDTRU Cryptosystem Based on Hexadecnion Algebra, Cryptology Conference (2016).
[7] N.M. Al-Saidi and H.R. Yassein, BITRU: Binary Version of the NTRU Public Key Cryptosystem via binary algebra, Int. J. Adv. Comput. Sci. Appl., vol. 7, no. 11 (2016), [Online]. Available: https://doi.org/10.14569/ijacsa.2016.071101.
[8] N.M. Al-Saidi and H.R. Yassein, A new alternative to NTRU cryptosystem based on highly dimensional algebra with dense lattice structure, Malays. J. Math. Sci., vol. 11, pp. 29-43 (2017).
[9] H.R. Yassein and N.M.G. Al-Saidi, BCTRU: A New Secure NTRUCrypt Public Key System Based on a Newly multidimensional Algebra, Proceeding of the 6th International Cryptology and Information Security Conference, Malaysia, 1-11 (2018).
[10] H.H. Abo-Alsood and H.R. Yassein, QOTRU: A new design of NTRU public key encryption via Qu- Octonion subalgebra, J. Phys. Conf. Ser., vol. 1999, no. 1, pp. 012097-012097, [Online]. Available: https://doi.org/10.1088/1742-6596/1999/1/012097.
[11] S.H. Shihadi and H.R. Yassein. A new Design of NTRU Encrypt- analogue Cryptosystem with high security and Performance level via Trip ternion algebra, Int. J. Math. Comput. Sci., vol. 16, no. 4, pp. 1515-1522 (2021), [Online]. Available: https://future-in-tech.net/16.4/r-HassanYasein.pdf
[12] H.R. Yassein, A.A. Abidalzahra and N. M. Al-Saidi, A new design of NTRU encryption with security and performance level, AIP Conference Proceedings, vol. 2334, no. 1, 08005-08009 (2021), https://doi.org/10.1063/5.0042312.
[13] M.H. Al-Awadi, Designing an Efficient and Scure Cryptosystems Similar to MaTRU and RSA, M. SC. Thesis, University of Al-Qadisiya, Iraq, (2022).
[14]  S.H. Shihadi and H.R. Yassein, “An innovative tripternion algebra for designing NTRU-like cryptosystem with high security”, AIP Conference Proceedings, vol. 2386, pp. 60009-1-60009-6 (2022). https://doi.org/10.1063/5.0067023
[15] H.H. Abo-alsood and H.R. Yassein, “Analogue to NTRU public key cryptosystem by multi-dimension algebra with high security’’, AIP Conference Proceedings, vol. 2386, pp. 600091-600096 (2022), [Online]. Available: https://doi.org/10.1063/5.0067033.
[16] F.R. Atea and H.R. Yassein, PMRSA: Designing an Efficient and Secure Public-Key Similar to RSA Based on Polynomial Ring, Appl. Math. Info. Sci., vol. 17, no. 3, pp. 535-538, May (2023), [Online]. Available: https://doi.org/10.18576/amis/170321.
[17] H.R. Yassein, H.N. Zaky, H.H. Abo-Alsood, I. A. Mageed and W. I. El Sobky, QuiTRU: Design Secure Variant of Ntruencrypt Via a New Multi-Dimensional Algebra, Appl. Math. Info. Sci., vol. 17, no. 1, pp. 49-53, Jan. (2023), [Online]. Available: https://doi.org/10.18576/amis/170107.
[18] S. M. Abboud and H.R. Yassein, Improvement Multi-Dimensional Public key OTRU Cryptosystem, Int. J. Math. Comput. Sci., vol. 19, no. 4, pp. 1071-1076 (2024),
[19] H.H. Abo-Alsood, M.H. Hamza, S. A. Al-Bairmani and H.R. Yassein, HH-RSA: Development of Public key Cryptosystem RSA via multidimensional algebra, Int. J. Math. Comput. Sci., vol. 19, no. 4, pp. 1177-1182 (2024). [Online]. Available: https://future-in-tech.net/19.4/R-Abo-Alsood-Hamz-Al-Bairmani-Yassein.pdf.
[20] B.N. Abaas and H.R. Yassein, Design of an Alternative to Polynomial Modified RSA Algorithm, Int. J. Math. Comput. Sci., vol. 19, no. 3, pp. 693-696, Feb. (2024),
[21] S.M. Abboud, R.K. Ajeena and H.R. Yassein, Octonion Polynomials for a More Secure RSA Public Key Cryptosystem. Int. J. Math. Comput. Sci., vol. 20, no.1, pp. 281-284 (2025), [Online]. Available: https://doi.org/10.69793/ijmcs/01.2025/yassein.
[22] F. Afzal, S. Rukh, D. Afzal, M.R. Farahani, M. Cancan and S. Ediz, “A study of non-commutative Von-Neumann regular rings,” J. Inf. Optim. Sci., vol. 42, no. 7, pp. 1425-1436 (2021). [Online] Available: https://doi.org/10.1080/02522667.2021.1896650. 
[23] M. Nadeem, S. Ahmad, M.K. Siddiqui, M.A. Ali, M.R. Farahani and A.J.M. Khalaf, “On some applications related with algebraic structures through different well known graphs,” J. Discrete Math. Sci. Cryptography, vol. 24, no. 2, pp. 451-471 (2021). [Online] Available: https://doi.org/10.1080/0972052. 
[24] S. Ediz, M. Cancan and M.R. Farahani, “Eccentric connectivity and connective eccentricity indices of generalized Petersen graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2021, no. 1, pp. 1-6 (2021). 
[25] R. Ponraj, S. Prabhu and M. Sivakumar, “Pair mean cordial label-ing of total graph of some graphs and prism-related graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 181-192 (2024). 
[26] F.O. Oduol and I.O. Okoth, “Counting vertices among all noncross¬ing trees by levels and degrees,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).

Views: 239Downloads: 84Citations: 0