Jianzhou Mao

Dr. Jianzhou Mao

Computer Science, Morgan State University, Baltimore, Maryland, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
1 January 2022 in Sustainable Computing: Informatics and Systems
Verified
Journal Article
Closed access
JMJianzhou Mao
Jianzhou Mao
XPXiaopu Peng
Xiaopu Peng
TCTing Cao
Ting Cao
TBTathagata Bhattacharya
Tathagata Bhattacharya
XQXiao Qin
Xiao Qin

10 June 2026 in Future Internet
Verified
Journal Article
Open access
PDF file
ESEric Sakk
Eric Sakk
GXGuobin Xu
Guobin Xu
JMJianzhou Mao
Jianzhou Mao
SWShuangbao Wang
Shuangbao Wang
Post-quantum cryptographic (PQC) algorithms are being developed to guard against quantum-computing attacks, but their behavior in constrained Internet of Things (IoT) environments remains an important topic of discussion. In this work, we study the impact of deploying PQC protocols in IoT networks using the Open Quantum Safe (liboqs) framework. In particular, key encapsulation and digital signature schemes are evaluated in terms of their computational performance, communication costs, and energy consumption. Our results indicate that although PQC operations can be completed in microseconds using general-purpose processors, substantially larger key and ciphertext sizes introduce significant communication overhead. When mapped to common IoT protocols such as Bluetooth Low Energy (BLE), IEEE 802.15.4 (Zigbee), and LoRa, these larger payloads must be divided into multiple packets. In low-payload LoRa networks, for example, ML-KEM handshakes can require up to 62 packets. This level of fragmentation increases latency and energy consumption, thus potentially affecting reliability. Furthermore, when packet delivery probabilities approaching 99% are achieved, handshake success rates can drop to values approaching 50%. These results suggest that communication metrics, rather than computational performance, pose key challenges to PQC deployment in constrained IoT settings.

26 April 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
GXGuobin Xu
Guobin Xu
OAOluwole Adetifa
Oluwole Adetifa
JMJianzhou Mao
Jianzhou Mao
ESEric Sakk
Eric Sakk
SWShuangbao Wang
Shuangbao Wang
Randomness is integral to computer security, influencing fields such as cryptography and machine learning. In the context of cybersecurity, particularly for the Internet of Things (IoT), high levels of randomness are essential to secure cryptographic protocols. Quantum computing introduces significant risks to traditional encryption methods. To address these challenges, we propose investigating a quantum-safe solution for IoT-trusted computing. Specifically, we implement the first lightweight, practical integration of a quantum random number generator (QRNG) with a software-based trusted platform module (TPM) to create a deployable quantum trusted platform module (QTPM) prototype for IoT systems to improve cryptographic capabilities. The proposed quantum entropy as a service (QEaaS) framework further extends quantum entropy access to legacy and resource-constrained devices. Through the evaluation, we compare the performance of QRNG with traditional Pseudo-random Number Generators (PRNGs), demonstrating the effectiveness of the quantum TPM. Our paper highlights the transformative potential of integrating quantum technology to bolster IoT security.

1 February 2022 in Journal of Engineering Research and Sciences
Verified
Journal Article
Open access
TBTathagata Bhattacharya
Tathagata Bhattacharya
XPXiaopu Peng
Xiaopu Peng
IJIshita Joshi
Ishita Joshi
TCTing Cao
Ting Cao
JMJianzhou Mao
Jianzhou Mao
XQXiao Qin
Xiao Qin
Prakriti: A Gamified Approach to Saving Water by Tathagata Bhattacharya* , Xiaopu Peng, Ishita Joshi, Ting Cao, Jianzhou Mao, Xiao Qin Department of Computer Science and Software Engineering, Auburn University, Auburn, 36832, USA * Author to whom correspondence should be addressed. Journal of Engineering Research and Sciences, Volume 1, Issue 2, Page # 33-40, 2022;