Graph Representation Learning of Lightweight IoT Ciphers

📅 2026-08-24
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
该研究针对SIMON和SIMECK轻量级密码算法易受差分密码分析攻击的问题,通过机器学习指导的图表示学习方法高效识别并可视化高概率差分簇。
📝 Abstract
SIMON and SIMECK belong to a family of Lightweight Cryptographic Algorithms (LCAs) based on the Feistel block cipher, designed for Internet of Things (IoT) devices. As with all Feistel ciphers, they are susceptible to differential cryptanalysis, necessitating rigorous resilience evaluations. While state-of-the-art techniques leverage heuristics and sampling to improve efficiency, little work has applied Machine Learning (ML) guided Graph Representation Learning (GRL) to efficiently identify and visualise high-probability differential clusters. We address this gap by introducing an efficient feature engineering strategy that extracts four differential attributes from a partial Difference Distribution Table (pDDT), revealing structural information concealed in raw differential data. Utilising the enriched features, we construct and compare three ML-guided directed graphs for SIMON$32$ and SIMECK$32$ using K-Nearest Neighbour (KNN), Decision Trees (DT), and Random Forests (RF). To the best of our knowledge, our framework produces the first graph-based visualisation of the differential clustering effect, in which high-probability single-bit differentials form geometrically close clusters in the learned embedding. All three models achieve a precision of $1.0$ in identifying high-probability differentials, confirming zero false positives. KNN achieves the strongest cluster separation, the highest F1 score and the lowest graph construction time of approximately $2.3$ seconds, while DT and RF produce optimal paths with near-perfect regression. The results are consistent across both LCAs, demonstrating the applicability of the framework to other AND-rotation LCA families.
Problem

Research questions and friction points this paper is trying to address.

Differential Cryptanalysis
Lightweight Cryptographic Algorithms
Graph Representation Learning
Machine Learning
IoT
Innovation

Methods, ideas, or system contributions that make the work stand out.

Graph Representation Learning
Lightweight Cryptographic Algorithms
Differential Cryptanalysis
Feature Engineering
Machine Learning
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
Jonathan Cook
Jonathan Cook
PhD Candidate, Charles Sturt University
Information technologycybersecurityapplied analytics
S
Sabih ur Rehman
School of Computing, Mathematics and Engineering, Charles Sturt University, Australia
M
M. Arif Khan
School of Computing, Mathematics and Engineering, Charles Sturt University, Australia