A new designing of MaTRU cryptosystem
Asia Aqeel Abidalzahraasia1asia21998@gmail.comDepartment of Mathematics University of Al-Qadisiyah Al-Diwaniya, 58003, Iraq0009-0004-8004-1626View full profile → , *Hassan Rashed YasseinCorresponding authorhassan.yaseen@qu.edu.iqDepartment of Mathematics University of Al-QadisiyahDepartment of Mathematics College of Education University of Al-QadisiyahAl-Diwaniyah, Al-Qadisiyah, 58001, Iraq0000-0002-6788-0247View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 14 May 2024
- Published Online:
- 21 Mar 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2023
- Pages:
- 361–367
Abstract
Keywords
Subject Classifications
References
[1] A. A. Abidalzahra and H. R. Yassein, “Proposed development of NTRU encryption,” Int. J. Math. Comput. Sci., vol. 19, no. 3, pp. 715-719 (2024).
[2] H. H. Abo-Alsood and H. R. Yassein, “Design of an alternative NTRU encryption with high secure and efficient,” Int. J. Math. Comput. Sci., vol. 16, no. 4, pp. 1469-1477 (2021).
[3] H. H. Abo-Alsood and H. R. Yassein, “Analogue to NTRU public key cryptosystem by multi-dimensional algebra with high security,” AIP Conf. Proc., vol. 2386, no. 1, p. 060006 (2022). [Online]. Available: http://dx.doi.org/10.1063/5.0067033.
[4] H. A. Ali and H. R. Yassein, “QTNTR: A new secure NTRUEncrypt alternative with a high level of security,” Math. Statist. Eng. Appl., vol. 71, no. 4, pp. 5634-5639 (2022).
[5] O. Benamara and F. Merazka, “A new distribution version of Boneh-Goh-Nissim cryptosystem: Security and performance analysis,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 6, pp. 1633-1647 (2022). [Online]. Available: https://doi.org/10.1080/09720529.2020.1782570.
[6] A. Chillali and M. Sahmoudi, “SCC-Cryptosystem on an algebraic closure ring,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 8, pp. 1475-1485 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2019.1624338.
[7] M. Coglianese and B.-M. Goi, “MaTRU: A new NTRU-based cryptosystem,” in Progress in Cryptology - INDOCRYPT 2005, S. Maitra, C. E. Veni Madhavan, and R. Venkatesan, Eds., Berlin, Heidelberg: Springer, pp. 232-243 (2005).
[8] E. N. Hameed and H. R. Yassein, “QOCNTR: Improved NTRU public key based on a new algebraic structure,” Math. Statist. Eng. Appl., vol. 71, no. 4, pp. 5627-5633 (2022).
[9] J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: A ring-based public key cryptosystem,” in Algorithmic Number Theory, J. P. Buhler, Ed., Berlin, Heidelberg: Springer, pp. 267-288 (1998). [Online]. Available: https://doi.org/10.1007/BFb0054868.
[10] B. Imine, N. Hadj-Said, and A. Ali-Pacha, “New McEliece cryptosystem based on non-permutation equivalent polar codes,” J. Discrete Math. Sci. Cryptogr., vol. 26, no. 1, pp. 103-114 (2023). [Online]. Available: https://doi.org/10.1080/09720529.2021.1933706.
[11] H. S. Salman and H. R. Yassein, “An innovative HSS algebra for designing a secure like-NTRU encryption,” Math. Statist. Eng. Appl., vol. 71, no. 4, pp. 6098-6113 (2022).
[12] H. S. Salman and H. R. Yassein, “Structure a public-key cryptosystem based on HSS algebra,” Appl. Math. Inf. Sci., vol. 17, no. 4, pp. 659-661 (2023). [Online]. Available: http://dx.doi.org/10.18576/amis/170414.
[13] H. S. Salman and H. R. Yassein, “TRUFT: A new public key cryptosystem based on novel FTH algebra,” Int. J. Math. Comput. Sci., vol. 18, no. 4, pp. 589-593 (2023).
[14] H. S. Salman and H. R. Yassein, “TRUHSH: Developing NTRU cryptosystem in terms of security and performance,” Appl. Math. Inf. Sci., vol. 17, no. 4, pp. 723-725 (2023). [Online]. Available: http://dx.doi.org/10.18576/amis/170420.
[15] S. H. Shahhadi and H. R. Yassein, “A new design of NTRU encrypt-analog cryptosystem with high security and performance level via tripternion algebra,” Int. J. Math. Comput. Sci., vol. 16, no. 4, pp. 1515-1522 (2021).
[16] S. H. Shahhadi and H. R. Yassein, “NTRsh: A new secure variant of NTRUEncrypt based on tripternion algebra,” J. Phys.: Conf. Ser., vol. 1999, no. 1, p. 012092 (2021). [Online]. Available: http://dx.doi.org/10.1088/1742-6596/1999/1/012092.
[17] S. H. Shahhadi and H. R. Yassein, “An innovative tripternion algebra for designing NTRU-like cryptosystem with high security,” AIP Conf. Proc., vol. 2386, no. 1 (2022). [Online]. Available: http://dx.doi.org/10.1063/5.0067023.
[18] D. K. Verma, M. Rani, R. K. Tyagi, and B. B. Sagar, “Baptista chaotic cryptosystem based on alternate superior dynamic lookup table,” J. Discrete Math. Sci. Cryptogr., vol. 22, no. 8, pp. 1383-1392 (2019). [Online]. Available: https://doi.org/10.1080/09720529.2019.1692446.
[19] H. Yassein, A. Reshan, and N. Al-Saidi, “AHQTR: A new NTRU variant based on quaternion algebra,” in Proc. 8th Int. Cryptol. Inf. Security Conf., Port Dickson, Negeri Sembilan, pp. 100-108 (2022).
[20] H. R. Yassein, A. A. Abidalzahra, and N. M. Al-Saidi, “A new design of NTRU encryption with high security and performance level,” AIP Conf. Proc., vol. 2334, no. 1, p. 080005 (2021). [Online]. Available: https://doi.org/10.1063/5.0042312.
[21] H. R. Yassein, H. N. Zaky, H. H. Abo-Alsoo, I. A. Mageed, and W. I. El-Sobky, “QuiTRU: Design secure variant of NtruEncrypt via a new multi-dimensional algebra,” Appl. Math. Inf. Sci., vol. 17, no. 1, pp. 49-53 (2023). [Online]. Available: http://dx.doi.org/10.18576/amis/paper.
[22] H. R. Yassein, N. M. G. Al-Saidi, and A. K. Farhan, “A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 2, pp. 523-542 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1741218.
[23] A. H. Alwan, “Small intersection graph of subsemimodules of a semimodule,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022).
[24] S. Ediza, M. Cancana, 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 labeling 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 noncrossing trees by levels and degrees,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).
