Madjid Golparvaran Tehrani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Madjid Golparvaran Tehrani has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- William Johnston Buchanan
School of Computing, Edinburgh Napier University
7 shared publications - Eldar Sultanow
Business Informatics, Processes and Systems, University of Pots dam, Karl-Marx-Straße 67, 14482 Potsdam, Germany, Germany
4 shared publications - Christel H. Djaha Fodja
The George Washington University Washington DC USA
2 shared publications - Mahkame Houmani
The George Washington University, Washington, USA
2 shared publications - Paul Rochford
BlockPass ID Lab, Edinburgh Napier University, Edinburgh EH10 5DT, UK
2 shared publications - Richard Macfarlane
BlockPass ID Lab, Edinburgh Napier University, Edinburgh EH10 5DT, UK
2 shared publications
Latest Publications
- Open Access
- 3 August 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (4) , 55
Energy Consumption of Post-Quantum Cryptography on Constrained and General-Purpose Architectures
With Q-day approaching, the transition to post-quantum cryptography (PQC) has begun, with governments across the US, UK and EU mandating migration to quantum-resistant standards. This paper benchmarks the three NIST-standardised PQC algorithms—FIPS 203 (ML-KEM), FIPS 204 (ML-DSA) and FIPS 205 (SLH-DSA)—across key generation, signing and verification operations, measuring both computational performance and energy consumption on a range of constrained IoT-class devices, from the 32-bit Raspberry Pi 1 and Zero to the 64-bit Raspberry Pi 4, as well as commodity laptop hardware. Using the FNIRSI FNB58 USB power meter and OpenSSL 3.5, results show that ML-KEM and ML-DSA achieve energy and speed efficiency comparable to classical elliptic-curve cryptography across all tested architectures. However, SLH-DSA signing is inadvisable on constrained hardware: energy costs for SLH-DSA signing on 32-bit devices were up to 243% higher than on equivalent 64-bit hardware, making it impractical for resource-limited IoT deployments. These findings have direct implications for IoT security practitioners planning PQC migration.
- 3 August 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (4) , 55
Open AccessEnergy Consumption of Post-Quantum Cryptography on Constrained and General-Purpose Architectures
With Q-day approaching, the transition to post-quantum cryptography (PQC) has begun, with governments across the US, UK and EU mandating migration to quantum-resistant standards. This paper benchmarks the three NIST-standardised PQC algorithms—FIPS 203 (ML-KEM), FIPS 204 (ML-DSA) and FIPS 205 (SLH-DSA)—across key generation, signing and verification operations, measuring both computational performance and energy consumption on a range of constrained IoT-class devices, from the 32-bit Raspberry Pi 1 and Zero to the 64-bit Raspberry Pi 4, as well as commodity laptop hardware. Using the FNIRSI FNB58 USB power meter and OpenSSL 3.5, results show that ML-KEM and ML-DSA achieve energy and speed efficiency comparable to classical elliptic-curve cryptography across all tested architectures. However, SLH-DSA signing is inadvisable on constrained hardware: energy costs for SLH-DSA signing on 32-bit devices were up to 243% higher than on equivalent 64-bit hardware, making it impractical for resource-limited IoT deployments. These findings have direct implications for IoT security practitioners planning PQC migration.
- 1 June 2026
- Published by Springer Nature
- p. 666-684
A Methodology for Analysing Coding Bugs for LLMs and SAST
- 1 June 2026
- Published by Springer Nature
- p. 666-684
A Methodology for Analysing Coding Bugs for LLMs and SAST
- Open Access
- 20 March 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (2) , 20
Securely Scaling Autonomy: The Role of Cryptography in Future Unmanned Aircraft Systems (UASs)
The decentralisation of autonomous Unmanned Aircraft Systems (UASs) introduces significant challenges in terms of establishing secure communication and consensus in contested, resource-constrained environments. This research addresses these challenges by conducting a comprehensive performance evaluation of two cryptographic technologies: Messaging Layer Security (MLS) for group key exchange, and threshold signatures (FROST and BLS) for decentralised consensus. Seven leading open-source libraries were methodically assessed through a series of static, network-simulated, and novel bulk-signing benchmarks to measure their computational efficiency and practical resilience. This paper confirms that MLS is a viable solution, capable of supporting the group sizes and throughput requirements of a UAS swarm. It corroborates prior work by identifying the Cisco MLSpp library as unsuitable for dynamic environments due to poorly scaling group management functions, while demonstrating that OpenMLS is a highly performant and scalable alternative. Furthermore, the findings show that operating MLS in a ‘key management’ mode offers a dramatic increase in performance and resilience, a critical trade-off for UAS operations. For consensus, the benchmarks reveal a range of compromises for developers to consider, while identifying the Zcash FROST implementation as the most effective all-around performer for sustained, high-volume use cases due to its balance of security features and efficient verification.
- 20 March 2026
- Published by MDPI AG in Cryptography
- Vol. 10 (2) , 20
Open AccessSecurely Scaling Autonomy: The Role of Cryptography in Future Unmanned Aircraft Systems (UASs)
The decentralisation of autonomous Unmanned Aircraft Systems (UASs) introduces significant challenges in terms of establishing secure communication and consensus in contested, resource-constrained environments. This research addresses these challenges by conducting a comprehensive performance evaluation of two cryptographic technologies: Messaging Layer Security (MLS) for group key exchange, and threshold signatures (FROST and BLS) for decentralised consensus. Seven leading open-source libraries were methodically assessed through a series of static, network-simulated, and novel bulk-signing benchmarks to measure their computational efficiency and practical resilience. This paper confirms that MLS is a viable solution, capable of supporting the group sizes and throughput requirements of a UAS swarm. It corroborates prior work by identifying the Cisco MLSpp library as unsuitable for dynamic environments due to poorly scaling group management functions, while demonstrating that OpenMLS is a highly performant and scalable alternative. Furthermore, the findings show that operating MLS in a ‘key management’ mode offers a dramatic increase in performance and resilience, a critical trade-off for UAS operations. For consensus, the benchmarks reveal a range of compromises for developers to consider, while identifying the Zcash FROST implementation as the most effective all-around performer for sustained, high-volume use cases due to its balance of security features and efficient verification.
- Open Access
- 14 January 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (1) , 14
On Families of Elliptic Curves That Intersect the Same Line of Rational SlopeWe investigate a special family of elliptic curves, namely , where are odd primes. We study sufficient conditions for p and q so that the corresponding elliptic curve has non-trivial rational points. The number of sufficient conditions reduces to six. These six sufficient conditions relate to Polignac’s conjecture, to the prime gap problem, the twin prime conjecture, and to results from Green and Sawhney and Friedlander and Iwaniec. Additionally, we analyze the structures of the sufficient conditions for p and q by their graphical visualizations of the six sufficient conditions for . The graphical structures for the six sufficient conditions exhibit arc structures, quasi-linear arc segments, tile structures, and sparsely populated structures.- 14 January 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (1) , 14
Open AccessOn Families of Elliptic Curves That Intersect the Same Line of Rational SlopeWe investigate a special family of elliptic curves, namely , where are odd primes. We study sufficient conditions for p and q so that the corresponding elliptic curve has non-trivial rational points. The number of sufficient conditions reduces to six. These six sufficient conditions relate to Polignac’s conjecture, to the prime gap problem, the twin prime conjecture, and to results from Green and Sawhney and Friedlander and Iwaniec. Additionally, we analyze the structures of the sufficient conditions for p and q by their graphical visualizations of the six sufficient conditions for . The graphical structures for the six sufficient conditions exhibit arc structures, quasi-linear arc segments, tile structures, and sparsely populated structures. - Open Access
- 9 December 2025
- Published by MDPI AG in Preprints.org
Securely Scaling Autonomy: The Role of Cryptography in Future Unmanned Aircraft Systems (UAS)
The decentralisation of autonomous Unmanned Air Systems (UAS) introduces significant challenges for establishing secure communication and consensus in contested, resource-constrained environments. This dissertation addresses these challenges by conducting a comprehensive performance evaluation of two cryptographic technologies: Messaging Layer Security (MLS) for group key exchange, and threshold signatures (FROST and BLS) for decentralised consensus. Seven leading open-source libraries were methodically assessed through a series of static, network-simulated, and novel bulk-signing benchmarks to measure their computational efficiency and practical resilience. This paper confirms that MLS is a viable solution, capable of supporting the group sizes and throughput requirements of a UAS swarm. It corroborates prior work by identifying the Cisco MLSpp library as unsuitable for dynamic environments due to poorly scaling group management functions, while demonstrating that OpenMLS is a highly performant and scalable alternative. Furthermore, the findings show that operating MLS in a 'Key Management' mode offers a dramatic increase in performance and resilience, a critical trade-off for UAS operations. For consensus, the benchmarks reveal a range of compromises for developers to consider, while identifying the Zcash FROST implementation as the most effective all-around performer for sustained, high-volume use cases due to its balance of security features and efficient verification.
- 9 December 2025
- Published by MDPI AG in Preprints.org
Open AccessSecurely Scaling Autonomy: The Role of Cryptography in Future Unmanned Aircraft Systems (UAS)
The decentralisation of autonomous Unmanned Air Systems (UAS) introduces significant challenges for establishing secure communication and consensus in contested, resource-constrained environments. This dissertation addresses these challenges by conducting a comprehensive performance evaluation of two cryptographic technologies: Messaging Layer Security (MLS) for group key exchange, and threshold signatures (FROST and BLS) for decentralised consensus. Seven leading open-source libraries were methodically assessed through a series of static, network-simulated, and novel bulk-signing benchmarks to measure their computational efficiency and practical resilience. This paper confirms that MLS is a viable solution, capable of supporting the group sizes and throughput requirements of a UAS swarm. It corroborates prior work by identifying the Cisco MLSpp library as unsuitable for dynamic environments due to poorly scaling group management functions, while demonstrating that OpenMLS is a highly performant and scalable alternative. Furthermore, the findings show that operating MLS in a 'Key Management' mode offers a dramatic increase in performance and resilience, a critical trade-off for UAS operations. For consensus, the benchmarks reveal a range of compromises for developers to consider, while identifying the Zcash FROST implementation as the most effective all-around performer for sustained, high-volume use cases due to its balance of security features and efficient verification.
- Open Access
LLM vs. SAST: A Technical Analysis on Detecting Coding Bugs of GPT4-Advanced Data Analysis
With the rapid advancements in Natural Language Processing (NLP), large language models (LLMs) like GPT-4 have gained significant traction in diverse applications, including security vulnerability scanning. This paper investigates the efficacy of GPT-4 in identifying software vulnerabilities compared to traditional Static Application Security Testing (SAST) tools. Drawing from an array of security mistakes, our analysis underscores the potent capabilities of GPT-4 in LLM-enhanced vulnerability scanning. We unveiled that GPT-4 (Advanced Data Analysis) outperforms SAST by an accuracy of 94% in detecting 32 types of exploitable vulnerabilities. This study also addresses the potential security concerns surrounding LLMs, emphasising the imperative of security by design/default and other security best practices for AI.
Open AccessLLM vs. SAST: A Technical Analysis on Detecting Coding Bugs of GPT4-Advanced Data Analysis
With the rapid advancements in Natural Language Processing (NLP), large language models (LLMs) like GPT-4 have gained significant traction in diverse applications, including security vulnerability scanning. This paper investigates the efficacy of GPT-4 in identifying software vulnerabilities compared to traditional Static Application Security Testing (SAST) tools. Drawing from an array of security mistakes, our analysis underscores the potent capabilities of GPT-4 in LLM-enhanced vulnerability scanning. We unveiled that GPT-4 (Advanced Data Analysis) outperforms SAST by an accuracy of 94% in detecting 32 types of exploitable vulnerabilities. This study also addresses the potential security concerns surrounding LLMs, emphasising the imperative of security by design/default and other security best practices for AI.
- Open Access
- 1 January 2025
- Published by KEAI Publishing in Internet of Things and Cyber-Physical Systems
- Vol. 5, 241-261
Review of Generative AI methods in cybersecurity
- 1 January 2025
- Published by KEAI Publishing in Internet of Things and Cyber-Physical Systems
- Vol. 5, 241-261
Open AccessReview of Generative AI methods in cybersecurity
- Open Access
- 19 January 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-14
Stabilized quantum-enhanced SIEM architecture and speed-up through Hoeffding tree algorithms enable quantum cybersecurity analytics in botnet detection
For the first time, we enable the execution of hybrid quantum machine learning (HQML) methods on real quantum computers with 100 data samples and real-device-based simulations with 5000 data samples, thereby outperforming the current state of research of Suryotrisongko and Musashi from 2022 who were dealing with 1000 data samples and quantum simulators (pure software-based emulators) only. Additionally, we beat their reported accuracy of 76.8% by an average accuracy of 91.2%, all within a total execution time of 1687 s. We achieve this significant progress through two-step strategy: Firstly, we establish a stable quantum architecture that enables us to execute HQML algorithms on real quantum devices. Secondly, we introduce new hybrid quantum binary classifiers (HQBCs) based on Hoeffding decision tree algorithms. These algorithms speed up the process via batch-wise execution, reducing the number of shots required on real quantum devices compared to conventional loop-based optimizers. Their incremental nature serves the purpose of online large-scale data streaming for domain generation algorithm (DGA) botnet detection, and allows us to apply HQML to the field of cybersecurity analytics. We conduct our experiments using the Qiskit library with the Aer quantum simulator, and on three different real quantum devices from Azure Quantum: IonQ, Rigetti, and Quantinuum. This is the first time these tools are combined in this manner.
- 19 January 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-14
Open AccessStabilized quantum-enhanced SIEM architecture and speed-up through Hoeffding tree algorithms enable quantum cybersecurity analytics in botnet detection
For the first time, we enable the execution of hybrid quantum machine learning (HQML) methods on real quantum computers with 100 data samples and real-device-based simulations with 5000 data samples, thereby outperforming the current state of research of Suryotrisongko and Musashi from 2022 who were dealing with 1000 data samples and quantum simulators (pure software-based emulators) only. Additionally, we beat their reported accuracy of 76.8% by an average accuracy of 91.2%, all within a total execution time of 1687 s. We achieve this significant progress through two-step strategy: Firstly, we establish a stable quantum architecture that enables us to execute HQML algorithms on real quantum devices. Secondly, we introduce new hybrid quantum binary classifiers (HQBCs) based on Hoeffding decision tree algorithms. These algorithms speed up the process via batch-wise execution, reducing the number of shots required on real quantum devices compared to conventional loop-based optimizers. Their incremental nature serves the purpose of online large-scale data streaming for domain generation algorithm (DGA) botnet detection, and allows us to apply HQML to the field of cybersecurity analytics. We conduct our experiments using the Qiskit library with the Aer quantum simulator, and on three different real quantum devices from Azure Quantum: IonQ, Rigetti, and Quantinuum. This is the first time these tools are combined in this manner.