Skip to main content
Peer-Reviewed Open Access · CC BY-NC 4.0
Home › Issues › Volume 5 · Issue 1 › Article V5-I1-J-2026-0112
🔬 Original Research 🔓 Open Access ✓ Peer-Reviewed Vol. 5 · Issue 1 · Oct 2026 · Pages 01-07

RRAM-Based Physically Unclonable Fraud Authentication Engine for Secure Telecom Infrastructure- A Semiconductor Security Approach

PN
Priyanka Nehla
Uppsala University·
VN
Vaishnavi N Halarnkar✉️
National Forensic Sciences University·
SM
Sandeep Munjal✉️
National Forensic Sciences University·
3
Downloads
18
Views
7
Pages

DOI

📄

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

Showing 0 of 0 references · APA 7 format
👥

Author Information

Authors and Affiliations

PN
Priyanka Nehla ORCID
Uppsala University
VN
Vaishnavi N Halarnkar ORCIDCorresponding Author
National Forensic Sciences University
SM
Sandeep Munjal ORCIDCorresponding Author
National Forensic Sciences University

Contributions

Conceptualization, Data Curation, Formal Analysis, Funding Acquisition, Investigation, Methodology, Project Administration, Resources, Software, Supervision, Validation, Visualization, Writing – Original Draft, Writing – Review & Editing

⚖️

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 Trail
Complete editorial process — cryptographically verified
📋

Editorial Process Audit Trail

Chain ID: NFSU-2026-V5-I1-J-2026-0112-CHAIN ✓ Verified · 0 blocks · Genesis 0x9f2b

No History Found

This manuscript has no status history yet.

📅 Total editorial timeline: 0 blocks tracked Genesis Hash: 0x9f2b3c7d8e4a5f1b · Verified ✓
🔐

Verification & Trust

Compliant
COPE · ICMJE · FAIR · ORCID · CLOCKSS
🛡️

Article Integrity Verified

All editorial chain blocks cryptographically verified · Compliant with COPE, ICMJE, and FAIR standards

🔗 Chain Integrity
✓ 0 blocks verified
🌳 Genesis Hash (Merkle Root)
0x00000000cbab64dbb9b330f16a427712e3e2a73b
📝 Plagiarism Screening
% similarity · ✓
🤖 AI Content Detection
% probability · ✓
👥 Peer Reviewer Verification
1 verified reviewers (sealed)
🆔 ORCID Verification
3/3 authors verified
🔗 Crossref DOI Registration
Pending registration
📦 Preservation Archives
CLOCKSS ✓ Portico ✓
⚖️ Ethics Approval
💼 Conflict of Interest Declaration
🔐 Verification Standards: This article complies with COPE, ICMJE, FAIR data principles, iThenticate plagiarism screening, GPTZero AI content detection, and ORCID author identification. The audit trail is permanently preserved and independently verifiable.
ℹ️

About this article

📝 Cite this article · How to Cite

View all citation formats in sidebar →
📥 Received
12 October 2026
✏️ Revised
12 October 2026
✅ Accepted
12 October 2026
📅 Published
30 June 2026
📄 Version of Record
30 June 2026
📖 Issue
Volume 5, Issue 1 (June 2026)
📃 Pages
01-07 (7 pages)
🔢 Article Number
NFSU-V5-I1-V5-I1-J-2026-0112
📜 License
CC BY-NC 4.0
🔗

Share this article

Anyone you share the following link with will be able to read this content:

Provide free access to colleagues, peers, and your professional network — no subscription required for them to view the full article.

An unhandled error has occurred. Reload 🗙