A more secure new version of the encryption scheme
*Banen Najah AbassCorresponding authorBanenn.alkuzai@uokufa.edu.iqDepartment of MathematicsFaculty of Education for GirlsUniversity of KufaKufa, Al Najaf, 540011, Iraq0009-0006-5272-6868View full profile → , Hassan Rashed Yasseinhassan.yaseen@qu.edu.iqDepartment of MathematicsCollege of EducationUniversity of Al-QadisiyahAl-Qadisiyah, 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-2024
- Pages:
- 387–392
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, “QOTRU: A New Design of NTRU Public Key Encryption Via Qu-Octonion Subalgebra,” J. Phys. Conf. Ser., vol. 1999, no. 1, p. 012097 (2021). [Online]. Available: https://doi.org/10.1088/1742-6596/1999/1/012097.
[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] E. Bresson, O. Chevassut, and D. Pointcheval, “The Group Diffie-Hellman Problems,” in Selected Areas in Cryptography, K. Nyberg and H. Heys, Eds., Berlin, Germany: Springer, pp. 325-338 (2003).
[5] 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.
[6] B. Den Boer, “Diffie-Hellman is as strong as discrete log for certain primes,” in Conf. Theory and Appl. Cryptogr., Springer, pp. 530-539 (1988).
[7] A. Escala, G. Herold, E. Kiltz, C. Ràfols, and J. Villar, “An algebraic framework for Diffie–Hellman assumptions,” J. Cryptol., vol. 30, pp. 242-288 (2017). [Online]. Available: https://doi.org/10.1007/s00145-015-9220-6.
[8] M. Hellman and W. Diffie, “New directions in cryptography,” IEEE Trans. Inf. Theory, vol. 22, no. 6, pp. 644-654 (1976). [Online]. Available: https://doi.org/10.1109/TIT.1976.1055638.
[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, Germany: 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. 23, no. 8, pp. 1-12 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1933706.
[11] 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.
[12] 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, p. 060006 (2022). [Online]. Available: http://dx.doi.org/10.1063/5.0067023.
[13] 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.
[14] H. Yassein, N. Al-Saidi, and A. Almosawi, “A multi-dimensional algebra for designing an improved NTRU cryptosystem,” Eurasian J. Math. Comput. Appl., vol. 8, no. 4, pp. 97-107 (2020). [Online]. Available: https://doi.org/10.1063/5.0067023.
[15] 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.
[16] H. R. Yassein, N. M. 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 (2022). [Online]. Available: https://doi.org/10.1080/09720529.2020.1741218.
[17] H. R. Yassein and H. A. Ali, “SQNTRU: New Public Key Encryption,” Int. J. Math. Comput. Sci., vol. 18, no. 3, pp. 381-385 (2023).
[18] 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. Inform. Sci., vol. 17, no. 1, pp. 49-53 (2023). [Online]. Available: http://dx.doi.org/10.18576/amis/paper.
[19] A. H. Alwan, “Small Intersection Graph of Subsemimodules of a Semimodule,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022).
[20] S. Ediza, M. Cancana, and M. R. Farahani, “Eccentric Connectivity and Connective Eccentricity Indices of Generalized Petersen Graphs,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2021, no. 1, pp. 1-6 (2021).
[21] R. Ponraj, S. Prabhu, and M. Sivakumar, “Pair Mean Cordial Labeling of Total Graph of Some Graphs and Prism Related Graphs,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 181-192 (2024).
[22] F. O. Oduol and I. O. Okoth, “Counting vertices among all noncrossing trees by levels and degrees,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).
