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

Homomorphism encryption techniques leveraging AI and advanced algebraic structures

, , * , ,

* Corresponding author · click or hover a name for details

pp. 741–748Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2520 Crossmark XML
Received:
14 May 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2520
Pages:
741–748

Abstract

This paper introduces homomorphic encryption using AI and complex mathematical concepts. Use vector measure spaces and orthogonal sequences to identify the optimal encryption settings using AI models. The research creates fresh homomorphic encryption methods based on hard mathematical ideas. You can safely do calculations on encrypted data without having to decrypt it using these methods. Cryptography is even safer and more flexible when AI is used to create and handle keys. By adding AI to algorithms, it becomes easier to secure data and tweak parameters, which helps with issues of speed and scaling.  

Keywords

Subject Classifications

31A1033E30

References

[1] M. Ghahramani, R. Taheri, M. Shojafar, R. Javidan, and S. Wan, “Deep Image: A precious image based deep learning method for online malware detection in IoT environment,” Internet Things, vol. 27, pp. 101300 (2024).
[2] W. Jung, S. Kim, J. Ahn, J. H. Cheon, and Y. Lee, “Over 100× faster bootstrapping in fully homomorphic encryption through memory-centric optimization with GPUs,” IACR Trans. Cryptogr. Hardw. Embed. Syst., vol. 2021, pp. 114–148 (2021).
[3] Y.-R. Wang and Y.-C. Tsai, “The protection of data sharing for privacy in financial vision,” Appl. Sci., vol. 12, pp. 7408 (2022).
[4] A. Slavković and J. Seeman, “Statistical data privacy: A song of privacy and utility,” Annu. Rev. Stat. Appl., vol. 10, pp. 189–218 (2023).
[5] B. Umar, O. Olaniyi, D. Olajide, and E. Dogo, “Paillier cryptosystem based ChainNode for secure electronic voting,” Front. Blockchain, vol. 5, pp. 927013 (2022).
[6] V. K. Giri, D. Dahare, D. Ambule, A. Deshmukh, and R. Luche, “Design and fabrication of aerodynamic wind turbine,” Int. J. Mech. Eng. Res. (IJMER), vol. 14, no. 1, pp. 26–30 (May 2025).
[7] F. Caldarola, G. d’Atri, and E. Zanardo, “Neural fairness blockchain protocol using an elliptic curves lottery,” Mathematics, vol. 10, pp. 3040 (2022).
[8] B. Alaya, L. Laouamer, and N. Msilini, “Homomorphic encryption systems statement: Trends and challenges,” Comput. Sci. Rev., vol. 36, pp. 100235 (2020).
[9] S. Bej, “Hamiltonian cycles in annular decomposable Barnette graphs,” J. Discrete Math. Sci. Cryptogr., vol. 26, no. 4, pp. 951–965 (2023).
[10] S. Dhiman, G. K. Mahato, and S. K. Chakraborty, “Homomorphic encryption library, framework, toolkit and accelerator: A review,” SN Comput. Sci., vol. 5, pp. 24 (2023).
[11] H. Corrigan-Gibbs, A. Henzinger, Y. Kalai, and V. Vaikuntanathan, “Somewhat homomorphic encryption from linear homomorphism and sparse LPN,” Cryptol. ePrint Arch., vol. 15602, pp. 3–33 (2024).

Views: 254Downloads: 131Citations: 0