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

Algebraic curve constructions for lightweight key establishment

, , , , ,

* Corresponding author · click or hover a name for details

pp. 3863–3874Vol. 29Issue 10-AOctober 2026DOI: 10.47974/JDMSC-3015 Crossmark XML
Received:
01 Apr 2026
Published Online:
31 Oct 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-3015
Pages:
3863–3874

Abstract

In the context of Internet of Things (IoT) and embedded and low power wireless systems, lightweight key establishment mechanisms are essential for secure communications. This paper proposes an algebraic curve-based light weight key establishment scheme, which has high cryptographic security and low computation complexity. The method proposed combines optimized constructions of algebraic curves over finite fields and efficient scalar multiplication and memory-aware arithmetic to enable secure generation of shared secrets at constrained devices. A low-load protocol structure is presented for the generation of public keys, derivation of session keys and secure authentication between communicating entities. Experimental testing shows that the proposed framework requires a 28.6% less computation time and a 22.4% less amount of energy when compared with the traditional lightweight cryptography algorithms at the same level of security. The framework is designed for an extensible next-generation security applications for Internet of Things (IoT).

Keywords

Subject Classifications

68M2514Q0581P94

References

[1] A T. Khudhair, A. T. Maolood, and E. K. Gbashi, “Symmetry analysis in construction two dynamic lightweight S-boxes based on the 2D Tinkerbell map and the 2D Duffing map,” Symmetry, vol. 16, no. 7, Art. no. 872 (2024), doi: 10.3390/sym16070872.

[2] X. Hou and W. Wang, “Lightweight dynamic advanced encryption standard encryption based on S-box reconfiguration and real-time key expansion for secure over-the-air communication,” Electronics, vol. 14, no. 16, Art. no. 3274 (2025), doi: 10.3390/electronics14163274.

[3] A S. Alali, R. Ali, M. K. Jamil, J. Ali, and Gulraiz, “Dynamic S-box construction using Mordell elliptic curves over Galois field and its applications in image encryption,” Mathematics, vol. 12, no. 4, Art. no. 587 (2024), doi: 10.3390/math12040587.

[4] N. Byabarta, A. Chatterjee, and S. K. Mitra, “Trajectory-based linearization of nonlinear dynamical systems: A novel approach for improved accuracy and applicability in advanced applications,” Journal of Information and Optimization Sciences, vol. 46, no. 5, pp. 1725–1736 (2025), doi: 10.47974/JIOS-1952.

[5] S. N. F. M. A. Antony and M. F. A. Bahari, “Implementation of elliptic curves in the polynomial Blom key pre-distribution scheme for wireless sensor networks and distributed ledger technology,” Journal of Sensor and Actuator Networks, vol. 12, no. 1, Art. no. 15 (2023), doi: 10.3390/jsan12010015.

[6] S. Yadav, S. Rane, V. Pabalkar, S. Sahu, R. Kulkarni, A. Chitari, and T. Katte, “Advances in fuzzy logic and algebraic structures for industrial applications in control theory,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 5-B, pp. 1981–1991 (2025), doi: 10.47974/JDMSC-2373.

[7] T. Gebremichael, M. Gidlund, G. P. Hancke, and U. Jennehag, “Quantum-safe group key establishment protocol from lattice trapdoors,” Sensors, vol. 22, no. 11, Art. no. 4148 (2022), doi: 10.3390/s22114148.

[8] M. Karpinski, A. Sokolov, A. Tokkuliyeva, V. Radush, N. Kazakova, A. Shaikhanova, N. Zagorodna, and A. Korchenko, “Development of high-quality cryptographic constructions based on many-valued logic affine transformations,” Electronics, vol. 14, no. 10, Art. no. 2094 (2025), doi: 10.3390/electronics14102094.

[9] P.-P. Duong and C.-K. Pham, “Constructing 8 × 8 S-boxes with optimal Boolean function nonlinearity,” Cryptography, vol. 9, no. 4, Art. no. 67 (2025), doi: 10.3390/cryptography9040067.

[10] R. C. Poonia, T. Singh, C. K. Rajashri, D. Mondal, and S. M. Patil, “Optimizing communication system security through comprehensive testing and intelligent network configurations,” Journal of Information and Optimization Sciences, vol. 47, no. 5-A, pp. 1709–1717 (2026), doi: 10.47974/JIOS-2261.

[11] V. Jara-Vera and C. Sánchez-Ávila, “Some notes on a formal algebraic structure of cryptology,” Mathematics, vol. 9, no. 18, Art. no. 2183 (2021), doi: 10.3390/math9182183.

[12] I. Khanykov, V. Nenashev, and M. Kharinov, “Algebraic multi-layer network: Key concepts,” Journal of Imaging, vol. 9, no. 7, Art. no. 146 (2023), doi: 10.3390/jimaging9070146.

[13] C. Zong, “Some mathematical problems behind lattice-based cryptography,” Cryptography, vol. 10, no. 1, Art. no. 10 (2026), doi: 10.3390/cryptography10010010.

[14] Y. Lahraoui, S. Lazaar, Y. Amal, and A. Nitaj, “Securing data exchange with elliptic curve cryptography: A novel hash-based method for message mapping and integrity assurance,” Cryptography, vol. 8, no. 2, Art. no. 23 (2024), doi: 10.3390/cryptography8020023.

[15] S. Gueron, E. Persichetti, and P. Santini, “Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup,” Cryptography, vol. 6, no. 1, Art. no. 5 (2022), doi: 10.3390/cryptography6010005.

Views: 13Downloads: 8Citations: 0