CXChongyao Xu

Chongyao Xu

*This is an algorithmically generated author record based on publicly available information.

Chongyao Xu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks

    by Chongyao Xu, Litao Zhang, Pui-In Mak, Rui P. Martins, Man-Kay Law

    In this paper, we propose a fully symmetrical obfuscated-interconnection PUF (SOI PUF), which contains n delay stages with each stage having 4 k obfuscated interconnections for resisting machine learning (ML)-based modeling attacks. All the delay stages contribute to k PUF primitives while achieving a 20× increase in the number of possible interconnections with the same hardware resources over similar prior arts. The SOI PUF mathematical model also theoretically demonstrates the large number of nonlinear matrix multiplications for resisting ML-based modeling attacks. We further exploit parallel weak PUF cells and propose the challenge-obfuscated SOI PUF (cSOI PUF), which can effectively prevent adversaries from bypassing unknown interconnections through reverse engineering (RE) attacks. The proposed SOI PUF and cSOI PUFs are evaluated by both software simulation and FPGA measurements. Without requiring a large k as in the existing PUF architectures, the simulation results demonstrate that the proposed SOI and cSOI PUFs can achieve a ~50% prediction accuracy for k ≥ 3, even when facing ML attacks using 5-hidden-layer Artificial Neural Network (ANN) with 40M training CRPs. Furthermore, the proposed (64,2/4/6/8)-SOI PUF and (64,2/4/6/8)-cSOI PUF implemented using Xilinx Artix-7 FPGA can both achieve a measured reliability and uniformity of >94% and ~50%, respectively. Depending on the value of k , the uniqueness ranges from 29.1% to 42.7% for SOI PUFs, and further improves to ~50% for cSOI PUFs. The resilience against Reliability-based modeling attacks, Probably Approximately Correct (PAC) attacks and Reverse-Engineering-based modeling attacks will also be discussed.


  • Modeling-Attack-Resistant Strong PUF Exploiting Stagewise Obfuscated Interconnections With Improved Reliability

    by Chongyao Xu, Litao Zhang, Man-Kay Law, Xiaojin Zhao, Pui-In Mak, Rui P. Martins

    This article presents an obfuscated-interconnection physical unclonable function (OIPUF) to resist modeling attacks. By introducing nonlinear operations through exploiting the random interconnections of delay stages, the proposed OIPUF can theoretically improve the PUF security while consuming the same hardware resources as the conventional XOR Arbiter PUF (XOR APUF). We further propose the metastability-detection (MD) arbiter to effectively improve the PUF reliability. Implemented on Xilinx Artix-7 FPGA, both the proposed (64,4)-and (64,8)-OIPUF demonstrate a good reliability and uniformity, with the proposed (64,8)-OIPUF showing a better uniqueness and strict avalanche criterion (SAC) performance. Measurement results also show that the proposed MD arbiter can reduce the bit error rate (BER) of the (64,4)-and (64,8)-OIPUF by.68 and.48 at up to 100.C, respectively. Evaluated using the Logistic Regression (LR), Artificial Neural Network (ANN), and Covariance Matrix Adaptation-Evolution Strategy (CMAES) machine learning (ML) algorithms, the proposed (64,4)-and (64,8)-OIPUF can achieve a worst case prediction accuracy of 61.47% and 50.59% with up to 10M CRPs as training set, respectively, demonstrating a significant improvement over similar prior arts.


  • Transfer-Path-Based Hardware-Reuse Strong PUF Achieving Modeling Attack Resilience With200 Million Training CRPs

    by Chongyao Xu, Jieyun Zhang, Man-Kay Law, Xiaojin Zhao, Pui-In Mak, Rui P. Martins

    This paper presents a hardware-reuse strong physical unclonable function (PUF) based on the intrinsic transfer paths (TPs) of a conventional digital multiplier to achieve a strong modeling attack resilience. With the multiplier input employed as the PUF challenge and the path delay as the entropy source, all the possible valid propagation paths from distinct input/output pairs can serve as PUF primitives. We can quantize the path delay using a time-to-digital converter (TDC), and select the suitable TDC output bits as the PUF response. We further propose a lightweight dynamic obfuscation algorithm (DOA) and a secure mutual authentication protocol to counteract modeling attacks. The proposed strong PUF using a 32×32 multiplier as implemented in the Xilinx ZYNQ-7000 SoC features a total of 2048 intrinsic PUF primitives, while achieving a response stream (RS) with an average of 1024 responses per TDC output bit per challenge. With Bit (5) and Bit (6) of the TDC output selected for PUF response generation, they demonstrate a measured reliability and uniqueness of up to 98.31% and 49.34%, respectively, with their excellent randomness performance as validated by the NIST SP800-22 tests. Under machine learning (ML)-based modeling attack with artificial neural network (ANN), the measured prediction accuracy of both Bit (5) and Bit (6) can still be maintained at ~50% with a total of >200 million CRPs as the training set.


  • Modeling Attack Resistant Strong PUF Exploiting Obfuscated Interconnections With <0.83% Bit-Error Rate

    by Chongyao Xu, Jieyun Zhang, Man-Kay Law, Yang Jiang, Xiaojin Zhao, Pui-In Mak, Rui P. Martins

    Silicon-based physical unclonable functions (PUFs), which exploit the natural random entropy during the chip manufacturing process, can generate random, unique and stable responses upon an input challenge. Instead of using complex crypto-algorithms, strong PUFs having a huge number of challenge-response pairs (CRPs) can be directly employed for low-cost authentication in many emerging IoT applications [1] –[4]. Yet, they typically are vulnerable towards machine learning (ML) attacks and exhibit a high bit-error rate (BER) [1], [5]. Even though the popular PUF obfuscation approach (e.g. hash processing and linear feedback shift register) can significantly enhance the ML attack resistance, they typically require extra processing steps involving PUF responses, which can inevitably degrade the achievable BER. This work reports an obfuscated interconnection physical unclonable function (OIPUF) containing two identical Ol blocks with intertwined stagewise intermediary networks. When compared with the conventional obfuscation approach, we explore the exponential stagewise interconnection to achieve intrinsic obfuscation without requiring extra hardware resources nor sacrificing the PUF reliability. We further propose a metastability-detection arbiter (MD-arbiter) array to improve the PUF reliability, demonstrating a measured worst case BER of 0.83% and an 1162x separation between inter and intra hamming distance (HD) while attaining a ML attack prediction accuracy of $\sim$ 50.59% with up to 10M training CRPs.


  • A 4T/Cell Amplifier-Chain-Based XOR PUF With Strong Machine Learning Attack Resilience

    by Jieyun Zhang, Chongyao Xu, Man-Kay Law, Yang Jiang, Xiaojin Zhao, Pui-In Mak, Rui P. Martins

    This paper presents an amplifier-chain-based XOR physical unclonable function (AC-XOR PUF), with the process- and/or bias-dependent voltage and amplification information of two identical amplifier chains serving as the entropy sources. The current-biased PUF cell using only 4 NMOS transistors achieves a small area with reduced temperature and supply sensitivity. Optimization on both the stage gain and stage number can reduce the input-referred noise (IRN) and improve the PUF reliability. We further employ an XOR gate to process the amplifier-chain outputs for the final response to improve the energy efficiency and uniqueness. The process- and bias-dependent stage amplification and the nonlinear amplifier-chain multiplication, which can significantly increase the number of modeling parameters and introduce a complex decision boundary respectively, can effectively resist machine learning (ML) modeling attacks. Fabricated in standard 65nm CMOS, the proposed AC-XOR PUF occupies an active area of $6845\mu \text{m}^{2}$ . Without discarding any challenge-response pairs (CRPs), this work features a measured worst case bit error rate (BER) of 5.70% across $1.06\sim 1.55V$ and $- 30\sim 125^{\circ }\text{C}$ , while demonstrating a reliability (intra-die HD) and uniqueness (inter-die HD) of 0.58% and 49.92%, respectively. It also achieves a ML prediction accuracy of 50.72% using $80\times 80\times 80$ artificial neural network (ANN) with 1M CPRs as training set.


  • The Software/Hardware Co-Design and Implementation of SM2/3/4 Encryption/Decryption and Digital Signature System

    by Xin Zheng, Chongyao Xu, Xianghong Hu, Yun Zhang, Xiaoming Xiong

    The security of smart devices is facing great challenges. This paper presents a new hybrid cipher framework suitable for such devices. Using software/hardware (SW/HW) co-design method, an efficient encryption/decryption and digital signature scheme based on SM2, SM3, SM4 algorithms is implemented. First, the framework is partitioned into software and hardware parts based on analysis result of a pure software solution and the hardware overhead under the conditions of design constraints. Second, the flow of the whole scheme and embedded algorithms are realized by SW/HW co-design. Finally, an improved implementation of SM2/3/4 algorithms is proposed to achieve higher efficiency. In this implementation, some SW/HW modules are parallelized to reduce the running time and enhance the performance. The proposed design is safe and can resist simple power analysis (SPA) attacks. Especially, the AHB bus interface IP and software scheduling approach are adopted in data transfer and manipulation. The design is taped-out on a silicon chip with SMIC 110nm technology process. The chip uses about 199K logic gates and 1mm areas. The operating frequency of the design is 36MHz and the chip consumes 23mW power. The comparison with similar previous works shows our proposed design is more efficient with speed increasing of more than ten percent.