Please use this identifier to cite or link to this item:
http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/31793Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | OJENIYI, Joseph Adebayo | - |
| dc.contributor.author | FASOLA, Olusanjo Olugbemi | - |
| dc.contributor.author | ONYEABOR, Grace Amina | - |
| dc.contributor.author | MUSA, A. A. | - |
| dc.contributor.author | MAKANJU, J. O. | - |
| dc.contributor.author | IYA, A. A. | - |
| dc.contributor.author | IKEGWU, C. C. | - |
| dc.date.accessioned | 2026-07-08T19:20:49Z | - |
| dc.date.available | 2026-07-08T19:20:49Z | - |
| dc.date.issued | 2026-03 | - |
| dc.identifier.uri | http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/31793 | - |
| dc.description.abstract | The growing number of Internet-of-Things devices deployed in industrial, healthcare, and smart infrastructure settings has created urgent demand for cryptographic solutions that work within tight computational limits. Current pseudorandom function implementations such as HMAC-SHA256 and AES-CMAC provide strong security but require memory and power resources beyond what ultraconstrained microcontrollers can deliver, particularly those with less than 32 KB RAM operating below 100 MHz. This paper introduces a lightweight PRF built solely from one-way functions, the most basic cryptographic assumption needed to construct secure pseudorandom primitives. Our design uses a reduced-round SHA-256-based OWF that processes keyed inputs through an iterative, low-overhead structure tailored to embedded platforms with limited resources. We show through careful security analysis that this construction preserves pseudorandomness guarantees while running in 0.88 milliseconds on ARM Cortex-M0 processors, a 7.3-fold speedup compared to standard HMAC-SHA256 implementations. Testing across STM32L0, ESP32, and AVR ATmega328P platforms shows memory usage under 2 KB Flash and 208 bytes RAM. The PRF passes all fifteen NIST Statistical Test Suite assessments with p-values above 0.01. These findings show that OWFbased PRF designs can serve as practical, cryptographically minimal security solutions for nextgeneration constrained IoT systems. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Advances in Mathematical & Computational Sciences | en_US |
| dc.relation.ispartofseries | Vol. 14 No. 1, March 2026 Series; | - |
| dc.subject | Lightweight Cryptography; Pseudorandom Functions; One-Way Functions; ATmega328P Internet of Things Security; Constrained Devices; Embedded Systems Cryptography; NIST Lightweight Standards | en_US |
| dc.title | A Lightweight Pseudorandom Function Construction from One-Way Functions for Resource-Constrained IoT Devices | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Cyber Security Science | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Paper 9 - AIMS-Maths Vol 14 No 1.pdf | 897.07 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.