Xiaofan Liu

Xiaofan Liu

Auto-generated profile, based on publicly available information

Xiaofan Liu

School of Microelectronics, Hefei University of Technology, Hefei, China

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
18 July 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
YZYanrui Zhao
Yanrui Zhao
XLXiaofan Liu
Xiaofan Liu
YHYue Hu
Yue Hu
HXHao Xiao
Hao Xiao
Number Theoretic Transform (NTT) and Inverse NTT (INTT) are the key algorithms used to speed up polynomial multiplications in post-quantum cryptography (PQC). This brief proposes a cross-bank-write-back (CBWB) memory mapping scheme for memory-based NTT/INTT architecture with conflict-free access patterns. The proposed scheme enables a light-weight memory access patterns for high-radix butterflies. Moreover, it makes the datapath between the memory banks and the butterfly unit straightforward and hardware-friendly. Based on the CBWB scheme, this work also proposes a solution to adopt a single decimation strategy for both NTT and INTT in PQC accelerators to reduce hardware resources. As a case study, an efficient NTT/INTT architecture has been implemented on the FPGA using the parameters of the PQC algorithm Falcon. Experimental results show that our design achieves better Area-Time Product (ATP) compared to the state-of-the-art designs.

4 May 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
YZYupeng Zhou
Yupeng Zhou
MFMingjie Fan
Mingjie Fan
XLXiaofan Liu
Xiaofan Liu
XXXin Xu
Xin Xu
YWYiyuan Wang
Yiyuan Wang
MYMinghao Yin
Minghao Yin

4 May 2022
Verified
Book Chapter
Closed access
PDF file
JHJiang Hong-Yan
Jiang Hong-Yan
YLYaping Lin
Yaping Lin
HSHuang Sheng-Ye
Huang Sheng-Ye
LXLiu Xiao-Fan
Liu Xiao-Fan
The problem of seeking for monitor-nodes to measure the network traffic is abstractly regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard. First, an approximation algorithm based on the concept of incidence matrix is proposed in this paper. Also, we analyze the complexity of the algorithm. Furthermore, the algorithm is expanded to seek for the minimum weak vertex cover of a graph that has weights on its nodes. According to the theoretical analysis and the simulation results, our novel algorithm is comparatively more patulous than the traditional algorithms, and more effective in searching for smaller weak vertex cover as well. Keywords: Weak vertex cover, nodes with weights, flow conservation, NP-hard, incidence matrix <!----> <!----> <!----> <!---->