Elliptic curve-inspired graph neural networks for lightweight cryptographic verification

Elliptic curve cryptography (ECC) is considered as a secure communication encryption method due to its high security-per-bit and efficiency on low power devices. Yet, the validation of ECC-based tasks (e.g. signature validation, key agreement) can be a heavy overhead for lightweight sensors and devices. In this paper, we introduce a novel framework, CurveGNN which uses Graph Neural Network (GNN) with elliptic curve-based structures to quickly and heuristically verify cryptography attributes. By converting the ECC point addition relations and scalar multiplications to graph-structured data, CurveGNN can learn signatures (e.g., ECDSA) validity with marginal arithmetic overhead. We detail the graph construction, GNN architecture, and training strategy. We demonstrate via experiments on embedded-class microcontrollers that CurveGNN achieves more than 95% verification accuracy, with average energy saving over 40% for ECC verification compared to ECC verification, respectively. From our results we observed that CurveGNN is a feasible lightweight verifier in Internet of Things and edge-computing environments.

Authors

Publication Details

Journal
Journal of Discrete Mathematical Sciences and Cryptography
Published
2025-01-01
DOI
https://doi.org/10.47974/jdmsc-2427
Primary Topic
Cryptography and Residue Arithmetic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Elliptic curve-inspired graph neural networks for lightweight cryptographic verification

Raju M. Sairise, Atmaram Shelke, S. Thakur, Bhushan Marutirao Nanche et al.
Journal of Discrete Mathematical Sciences and Cryptography
Cryptography and Residue Arithmetic
article

Elliptic curve-inspired graph neural networks for lightweight cryptographic verification

Raju M. Sairise, Atmaram Shelke, S. Thakur, Bhushan Marutirao Nanche, Nilesh M. Pawar, Vinay Prasad Tamta
article en

Abstract

Elliptic curve cryptography (ECC) is considered as a secure communication encryption method due to its high security-per-bit and efficiency on low power devices. Yet, the validation of ECC-based tasks (e.g. signature validation, key agreement) can be a heavy overhead for lightweight sensors and devices. In this paper, we introduce a novel framework, CurveGNN which uses Graph Neural Network (GNN) with elliptic curve-based structures to quickly and heuristically verify cryptography attributes. By converting the ECC point addition relations and scalar multiplications to graph-structured data, CurveGNN can learn signatures (e.g., ECDSA) validity with marginal arithmetic overhead. We detail the graph construction, GNN architecture, and training strategy. We demonstrate via experiments on embedded-class microcontrollers that CurveGNN achieves more than 95% verification accuracy, with average energy saving over 40% for ECC verification compared to ECC verification, respectively. From our results we observed that CurveGNN is a feasible lightweight verifier in Internet of Things and edge-computing environments.

Journal of Discrete Mathematical Sciences and CryptographyVol. 28(5-B)
Openalex Percentile: Top 66%
Cryptography and Residue Arithmetic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Elliptic curve-inspired graph neural networks for lightweight cryptographic verification — Raju M. Sairise, Atmaram Shelke, et al. · Journal of Discrete Mathematical Sciences and Cryptography (2025) | TGRS Research Map | TGRS