A new multi-dimensional public key cryptosystem via KAH-Octo algebra
*Kawthar Abdulabbas HassoonCorresponding authorkawthara.alshammari@student.uokufa.edu.iqDepartment of MathematicsFaculty of Education for GirlsUniversity of KufaKufa, Al Najaf, 540011, Iraq0009-0004-4168-4952View full profile → , Hassan Rashed Yasseinhassan.yaseen@qu.edu.iqDepartment of MathematicsFaculty of EducationUniversity of Al-QadisiyahAl-Diwaniya, 58003, Iraq0000-0002-6788-0247View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 May 2024
- Published Online:
- 21 Mar 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2018
- Pages:
- 349–354
Abstract
Keywords
Subject Classifications
References
[1] M. Chillali and M. Sahmoudi, “SCC-Cryptosystem on an algebraic closure ring,” J. Discrete Math. Sci. Cryptography, vol. 23, no. 8, pp. 1475-1485 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2019.1624338.
[2] N. Imine, N. Hadj-Said, and A. Ali-Pacha, “New McEliece cryptosystem based on non-permutation equivalent polar codes,” J. Discrete Math. Sci. Cryptography, 2 Aug. (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1933706.
[3] 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. Cryptography, vol. 22, no. 8, pp. 1383-1392 (2019). [Online]. Available: https://doi.org/10.1080/09720529.2019.169244.
[4] A. Malekian and A. Zakerolhosseini, “OTRU: A non-associative and high speed public key cryptosystem,” in Proc. 15th CSI Int. Symp. on Computer Architecture and Digital Systems, pp. 83-90 (2010). [Online]. Available: https://doi.org/10.1109/CADS.2010.5623536.
[5] 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, pp. 1-6 (2022). [Online]. Available: https://doi.org/10.1063/5.0067033.
[6] 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).
[7] 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. 1-7 (2021). [Online]. Available: https://doi.org/10.1088/1742-6596/1999/1/012097.
[8] 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. Cryptography, vol. 25, no. 2, pp. 523-542 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1741218.
[9] K. A. Hassoon and H. R. Yassein, “Proposed multi-dimensional algebra,” Int. J. Math. Comput. Sci., vol. 19, no. 3, pp. 765-770 (2024).
[10] O. Benamara and F. Merazka, “A new distribution version of Boneh-Goh-Nissim cryptosystem: Security and performance analysis,” J. Discrete Math. Sci. Cryptography, vol. 25, no. 6, pp. 1633-1647 (2022). [Online]. Available: https://doi.org/10.1080/09720529.2020.1782570.
[11] 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).
[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, pp. 1-6 (2022). [Online]. Available: https://doi.org/10.1063/5.0067023.
[13] 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, pp. 1-6 (2021). [Online]. Available: https://doi.org/10.1088/1742-6596/1999/1/012092.
[14] A. H. Alwan, “Small intersection graph of subsemimodules of a semimodule,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022).
[15] 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).
[16] 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).
[17] 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).
