RRAM-Based Physically Unclonable Fraud Authentication Engine for Secure Telecom Infrastructure- A Semiconductor Security Approach
📄
Abstract
Abstract: In today’s scenario, telecom infrastructure is vulnerable to sophisticated fraud schemes which exploits signaling systems, roaming agreements, SIM provisioning mechanisms, and network edge devices. Though software-based security options and public key infrastructure have extensively been used, hardware-level trust establishment remains a critical challenge. Here, we propose a Resistive Random Access Memory (RRAM) based Physically Unclonable Function (PUF) engine for secure authentication of telecom infrastructure. RRAM devices have unique filament formation mechanism which in inherent to each device. By using this stochastic conductance variations, we model a hardware entropy source for generating unique, temper-evident challenge-response pairs (CRPs). We present theoretical and simulation based architecture for future experimental implementation in hardware security. A mathematical framework for uniqueness, reliability and randomness metrics is presented which validates the architecture without reliance on empirical datasets. To further establish the theoretical framework, a Monte Carlo simulation was conducted across 200 synthesized RRAM device using a 64-bit crossbar configuration (𝝈𝒍𝒏 = 0.4, 𝝈𝒓𝒆𝒂𝒅 = 0.04) which yield uniqueness of 49.94%, reliability of 96.81% (BER = 3.19%), and entropy of 1 bits/cell. The proposed architecture is directly incorporated into telecom switching and gateway nodes, enabling protest against hardware cloning, rogue node insertion, and infrastructure-level spoofing. This framework serves a lightweight, non-volatile, and tamper-resistant security primitive that is suitable for large-scale, diverse telecom systems including 5G and future edge-computing platforms.
🏷️
Keywords
📖
Full Article
🖼️
Figures & Tables
📚
References
⚖️
Ethics Declarations
Ethics Approval and Consent to Participate
Users can freely download, share, and reuse the article for any purpose (even commercially), as long as they give proper credit to the original author.
Competing Interests
Users can freely download and share the article, but they are strictly prohibited from using it or selling it for commercial profit.
Consent for Publication
Users can only read and view the article for personal use; they cannot copy, redistribute, or reuse any part of it without explicit permission from your journal.
📋
Editorial Lifecycle
Audit TrailComplete editorial process — cryptographically verified
Editorial Lifecycle
Audit TrailEditorial Process Audit Trail
NFSU-2026-V5-I1-J-2026-0112-CHAIN
✓ Verified · 0 blocks · Genesis 0x9f2bNo History Found
This manuscript has no status history yet.
🔐
Verification & Trust
CompliantCOPE · ICMJE · FAIR · ORCID · CLOCKSS
Verification & Trust
CompliantArticle Integrity Verified
All editorial chain blocks cryptographically verified · Compliant with COPE, ICMJE, and FAIR standards