Abasianie Samuel Etuk

Abasianie Samuel Etuk

Computer Engineering, University of Uyo, Uyo, Akwa Ibom, Nigeria
orcid
QUANTUM COMPUTING RESEARCH SCIENTIST

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2024 in TechRxiv
Verified
Preprint
Open access
PDF file
Abasianie Samuel EtukAbasianie Samuel Etuk
Abasianie Samuel Etuk
The concept of rationality or irrationality of real numbers has been a fundamental question in mathematics for centuries. However, the theoretical and computational complexity of determining whether a given real number is rational or irrational presents an intriguing challenge. This research aims to explore the Undecidability of this problem and its inherent connection to the unresolvability found in the halting problem within the realm of computational theory. By investigating the parallels between the decision problem for rationality of real numbers and the halting problem, this study seeks to delve into the theoretical limits of computation and the boundaries that exist within mathematical systems. Through a combination of mathematical analysis and computational modeling, the research will examine the implications of Undecidability in determining the rationality of real numbers, shedding light on the broader implications for computability theory and theoretical computer science. The findings of this research will contribute to a deeper understanding of the intrinsic computational unresolvability present in determining the rationality of real numbers, offering insights into the intertwined nature of mathematical and computational complexity. Furthermore, the exploration of this topic has the potential to spark new perspectives on the limits of rationality and computability, paving the way for further investigations and potential applications in fields such as cryptography, number theory, and algorithmic complexity.

15 June 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
Abasianie Samuel EtukAbasianie Samuel Etuk
Abasianie Samuel Etuk
OIObongifreke Aniekan Inyang
Obongifreke Aniekan Inyang
BSBLISS UTIBE-ABASI Stephen
BLISS UTIBE-ABASI Stephen
PAPhilip Asuquo
Philip Asuquo
OOOfonime Dominic Okon
Ofonime Dominic Okon
Autonomous sensor networks and edge-based intelligent systems require lightweight cryptographic mechanisms capable of ensuring integrity, auditability, and replay resistance under constrained computational resources. This paper proposes a Quantum-Entropy-Assisted Hybrid Commitment (HQC) framework that integrates QRNG-derived entropy into a classical hash-based commitment architecture designed for embedded sensing environments. Experimental evaluation on a Raspberry Pi 4 achieved mean commit latency of 5.1 μs, verify latency of 2.2 μs, and Merkle root construction of 1.640 ms for 1024 leaves. Security validation over 10,000 trials yielded zero forgeries, complete replay rejection, and no statistical distinguishability (p=0.7947).The results show that a quantum-entropy-assisted commitment can be practically implemented on resource-constrained embedded systems without the use of infrastructure for quantum communication or quantum computation.