arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.07592quant-ph
收藏

量子密钥分发中基于FFT的保密放大在FPGA上的高速实现

High-speed Implementation of FFT-based Privacy Amplification on FPGA in Quantum Key Distribution

Qiong Li, Bing-Ze Yan, Hao-Kun Mao, Xiao-Feng Xue

摘要:

保密放大(PA)是量子密钥分发(QKD)中的一个重要过程,它能从通信双方相同的纠错密钥中产生出窃听者仅具有可忽略信息的密钥。随着离散变量量子密钥分配(DV-QKD)系统重复频率的不断提高,PA的处理速度已成为制约DV-QKD系统安全密钥速率的瓶颈。基于Toeplitz Hash函数的PA由于其简单性和并行性而被广泛采用。由于该算法可以用快速傅立叶变换(FFT)来加速,因此在此基础上提出了一种适用于现场可编程门阵列(FPGA)的PA改进方案。本文改进了基于FFT的自定义算法,显著减少了计算次数和读写内存操作。在Xilinx Virtex-6 FPGA上实现,验证了算法的正确性。同时,通过实际实验,改进方案在FPGA上的处理速度比经典Toeplitz散列方案提高了近一倍。

英文摘要:

Privacy amplification (PA) is a vital procedure in quantum key distribution (QKD) to generate the secret key that the eavesdropper has only negligible information from the identical correcting key for the communicating parties. With the increase of repeat frequency of discrete-variable QKD (DV-QKD) system, the processing speed of PA has become the bottle neck restricting DV-QKD's secure key rate. The PA using Toeplitz-based Hash function is adopted widely because of its simplicity and parallel feature. Because this algorithm can be accelerated with Fast Fourier Transform (FFT), an improved scheme PA for Field-programmable Gate Array (FPGA) based on this is proposed. This paper improves the custom FFT-based algorithm by reducing the number of computations and read/write memory operations significantly. The correctness is verified when implemented in a Xilinx Virtex-6 FPGA. Meanwhile, the processing speed of improved scheme can nearly double the classical Toeplitz Hashing scheme on FPGA through the actual experiment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑