Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Lightwave Technology

Joint Information Reconciliation-Privacy Amplification Scheme for CV-QKD

Kun Zhang, Jia Hou, Yan Feng, Xueqin Jiang, Enjian Bai, Peng Huang, Guihua Zeng

Published Aug 27, 2025• 0 citations
Publisher

Abstract

In the conventional post-processing phase of Gaussian-modulated coherent state (GMCS) quantum key distribution (QKD) systems, the processes of information reconciliation (IR) and privacy amplification (PA) are typically carried out sequentially and separately. This approach incurs substantial computational complexity and may introduce potential security risks, such as key storage risks. In this paper, we propose a more efficient and secure post-processing scheme that integrates IR and PA into a single process by utilizing well-designed spinal codes. The proposed scheme significantly reduces computational complexity by employing the linear-complexity hash function instead of the superlinear complexity Toeplitz matrices used in conventional PA schemes, and effectively mitigates potential security risks associated with conducting IR and PA as separate processes. Experimental results show that the final secret key throughput of the proposed scheme is at least 250 times higher than that of the conventional PA scheme, with the improvement in throughput becoming even greater as the block lengths increase. More importantly, owing to the rateless property and the capacity-approaching performance of spinal codes, the GMCS QKD systems can achieve reconciliation efficiencies of higher than 97% across a broad range of signal-to-noise ratios from -22.5641 to 0.122 dB.

DOI
10.1109/jlt.2025.3603253

Related papers

An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Bingze, Yan, Qiong Li, Haokun, Mao +1 more

Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.6*10^8 input block size) is twice higher than the best existing scheme (140Mbps@1*10^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.

arXiv:2105.13678•May 28, 2021•2 citations

Efficient FPGA-Based Implementation of Quantum Key Distribution Post-Processing System

Lianye Liao, Shi‐Hai Sun

Quantum key distribution (QKD), based on quantum mechanics, enables unconditionally secure key exchange even against adversaries with unlimited computing power. As the core of QKD post-processing, information reconciliation (IR) and privacy amplification (PA) ensure key consistency and security by correcting errors and removing leaked information. With the trend toward miniaturized and chip-based QKD systems, post-processing modules require highly integrated designs. FPGAs offer an ideal solution due to their low cost, power efficiency, and flexibility. This paper presents an FPGA-based QKD post-processing architecture using a polar codes-based appending IR algorithm, achieving reconciliation efficiency better than 1.1 under Eµ≥ 0.06 and Rm= 4. A convolution-structured Toeplitz hash module is developed for PA, supporting 53.13 Mbps data rate and 26.45 Mbps key rate with RPA= 0.5. The complete system is implemented on a Xilinx XCKU040 FPGA. Experimental results show support for 176.58 Mbps input, 36.59 Mbps real-time processing, and 17.56 Mbps key output, demonstrating strong performance and engineering suitability. The design features high integration and portability, offering a practical hardware solution for efficient QKD post-processing.

IEEE International Conference on Electronics, Communications and Intelligent Science (ECIS)•May 23, 2025•0 citations

High-Speed Post-Processing in Continuous-Variable Quantum Key Distribution Based on FPGA Implementation

Shenshen Yang, Zhenguo Lu, Yongmin Li

In a continuous-variable quantum key distribution (CV-QKD) system, the computation speed of the post-processing procedure, including information reconciliation (IR) and privacy amplification (PA), inevitably affects the practical secret key rate. IR and PA can be implemented in parallel using low-density parity-check (LDPC) codes and hash functions, respectively. We achieve high-speed hardware-accelerated post-processing procedure for Gaussian symbols on a field-programmable gate array (FPGA) by taking advantage of its superior parallel processing ability. To this end, the sum-product algorithm decoders and a modified LDPC codes construction algorithm adapted to FPGA's characteristics are developed and employed. Two different structures including multiplexing and non-multiplexing are designed to achieve the trade-off between the speed and area of FPGAs, so that an optimal scheme can be adopted according to the requirement of a practical system. Simulation results show that the maximum throughput can reach 100 M symbols/s. We verified the correctness of the post-processing procedures when implemented on the Xilinx VC709 evaluation board, which is populated with the Virtex-7 XC7VX690T FPGA and provided some possible solutions to obtain better performance when more advanced FPGAs are available. The scheme can be applied readily for real-time key extraction and effectively reduce power consumption of the CV-QKD system.

Journal of Lightwave Technology•Apr 6, 2020•58 citations

Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution

Lev Tauz, Debarnab Mitra, Jayanth Shreekumar +3 more

Quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important post-processing steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we consider a new technique of performing the IR and PA steps jointly through sampling that relaxes the requirement on the IR step, allowing for more success in key creation. We provide a novel LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement by creating LDPC codes with pre-defined sub-matrices of full-rank. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys.

arXiv:2403.00192•Feb 29, 2024•1 citation

Secret key extraction in direct reconciliation CV-QKD systems

Margarida Almeida, M. Facão, Nelson Jesus Muga +2 more

Quantum Key Distribution (QKD) is, nowadays, the dominant practical application in the quantum technologies field. Nevertheless, extracting secure keys from a physical implementation of a QKD system remains a complicated procedure. In this paper, post-processing algorithms were implemented to extract secret keys from a Continuous-Variable QKD (CV-QKD) system. The Discrete Modulated Four State CV-QKD protocol was considered due to lower complexity in the reconciliation procedure. The secret keys were extracted considering Maximum-Likelihood Estimators (MLEs) for parameter estimation, Iterative Low-Density Parity Check (LDPC) codes complemented with the Sum-Product Algorithm and error groups iterative reconciliation for information reconciliation, and the Toeplitz matrix as the universal hash function for privacy amplification. The post-processing algorithms were applied to extract secret keys from a simulated implementation of the Discrete Modulated Four State CV-QKD protocol, with double homodyne detection.

Telecoms Conference (ConfTELE)•Feb 11, 2021•2 citations

Twofold Information Reconciliation Based on Polar Codes for CV-QKD

Chuwen Yang, Meixiang Zhang, Yuheng Wang +1 more

Continuous variable quantum key distribution (CV-QKD) enables authenticated parties to share a key. Information reconciliation (IR) is a critical step of the post-processing in CV-QKD, significantly affecting the secret key rate (SKR) shared between the legitimate parties. To improve the SKR performance of the CV-QKD without increasing the key inconsistency rate (KIR), this paper proposes a twofold IR method by performing independent operations on the Gaussian modulated coherent states (GMCS) obtained over the quantum channel. Specifically, assuming reverse reconciliation, after the GMCS are quantized, Bob generates parity bits, which are shared with Alice to help her correct the inconsistent bits in the quantized bits to generate the partial key. At the same time, the parity bits are used as frozen bits of polar codes in the multidimensional reconciliation (MR) to generate the other partial key. Simulation results demonstrate that the proposed twofold IR method increases the SKR nearly twice without increasing the inconsistent bits. In addition, we propose to apply symbol expansion and rotation (SER) based on the mapped GMCS to reduce the amount of information to be transmitted over the public error-free channel. Simulation results demonstrate that the performance of the proposed twofold IR with SER method can achieve a higher SKR with 3dB performance gap to that of the traditional MR protocol.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 16, 2024•0 citations
In the conventional post-processing phase of Gaussian-modulated coherent state (GMCS) quantum key distribution (QKD) systems, the processes of information reconciliation (IR) and privacy amplification (PA) are typically carried out sequentially and separately. This approach incurs substantial computational complexity and may introduce potential security risks, such as key storage risks. In this paper, we propose a more efficient and secure post-processing scheme that integrates IR and PA into a single process by utilizing well-designed spinal codes. The proposed scheme significantly reduces computational complexity by employing the linear-complexity hash function instead of the superlinear complexity Toeplitz matrices used in conventional PA schemes, and effectively mitigates potential security risks associated with conducting IR and PA as separate processes. Experimental results show that the final secret key throughput of the proposed scheme is at least 250 times higher than that of the conventional PA scheme, with the improvement in throughput becoming even greater as the block lengths increase. More importantly, owing to the rateless property and the capacity-approaching performance of spinal codes, the GMCS QKD systems can achieve reconciliation efficiencies of higher than 97% across a broad range of signal-to-noise ratios from -22.5641 to 0.122 dB.
Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.6*10^8 input block size) is twice higher than the best existing scheme (140Mbps@1*10^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.
Quantum key distribution (QKD), based on quantum mechanics, enables unconditionally secure key exchange even against adversaries with unlimited computing power. As the core of QKD post-processing, information reconciliation (IR) and privacy amplification (PA) ensure key consistency and security by correcting errors and removing leaked information. With the trend toward miniaturized and chip-based QKD systems, post-processing modules require highly integrated designs. FPGAs offer an ideal solution due to their low cost, power efficiency, and flexibility. This paper presents an FPGA-based QKD post-processing architecture using a polar codes-based appending IR algorithm, achieving reconciliation efficiency better than 1.1 under Eµ≥ 0.06 and Rm= 4. A convolution-structured Toeplitz hash module is developed for PA, supporting 53.13 Mbps data rate and 26.45 Mbps key rate with RPA= 0.5. The complete system is implemented on a Xilinx XCKU040 FPGA. Experimental results show support for 176.58 Mbps input, 36.59 Mbps real-time processing, and 17.56 Mbps key output, demonstrating strong performance and engineering suitability. The design features high integration and portability, offering a practical hardware solution for efficient QKD post-processing.
In a continuous-variable quantum key distribution (CV-QKD) system, the computation speed of the post-processing procedure, including information reconciliation (IR) and privacy amplification (PA), inevitably affects the practical secret key rate. IR and PA can be implemented in parallel using low-density parity-check (LDPC) codes and hash functions, respectively. We achieve high-speed hardware-accelerated post-processing procedure for Gaussian symbols on a field-programmable gate array (FPGA) by taking advantage of its superior parallel processing ability. To this end, the sum-product algorithm decoders and a modified LDPC codes construction algorithm adapted to FPGA's characteristics are developed and employed. Two different structures including multiplexing and non-multiplexing are designed to achieve the trade-off between the speed and area of FPGAs, so that an optimal scheme can be adopted according to the requirement of a practical system. Simulation results show that the maximum throughput can reach 100 M symbols/s. We verified the correctness of the post-processing procedures when implemented on the Xilinx VC709 evaluation board, which is populated with the Virtex-7 XC7VX690T FPGA and provided some possible solutions to obtain better performance when more advanced FPGAs are available. The scheme can be applied readily for real-time key extraction and effectively reduce power consumption of the CV-QKD system.
Quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important post-processing steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we consider a new technique of performing the IR and PA steps jointly through sampling that relaxes the requirement on the IR step, allowing for more success in key creation. We provide a novel LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement by creating LDPC codes with pre-defined sub-matrices of full-rank. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys.
Quantum Key Distribution (QKD) is, nowadays, the dominant practical application in the quantum technologies field. Nevertheless, extracting secure keys from a physical implementation of a QKD system remains a complicated procedure. In this paper, post-processing algorithms were implemented to extract secret keys from a Continuous-Variable QKD (CV-QKD) system. The Discrete Modulated Four State CV-QKD protocol was considered due to lower complexity in the reconciliation procedure. The secret keys were extracted considering Maximum-Likelihood Estimators (MLEs) for parameter estimation, Iterative Low-Density Parity Check (LDPC) codes complemented with the Sum-Product Algorithm and error groups iterative reconciliation for information reconciliation, and the Toeplitz matrix as the universal hash function for privacy amplification. The post-processing algorithms were applied to extract secret keys from a simulated implementation of the Discrete Modulated Four State CV-QKD protocol, with double homodyne detection.
Continuous variable quantum key distribution (CV-QKD) enables authenticated parties to share a key. Information reconciliation (IR) is a critical step of the post-processing in CV-QKD, significantly affecting the secret key rate (SKR) shared between the legitimate parties. To improve the SKR performance of the CV-QKD without increasing the key inconsistency rate (KIR), this paper proposes a twofold IR method by performing independent operations on the Gaussian modulated coherent states (GMCS) obtained over the quantum channel. Specifically, assuming reverse reconciliation, after the GMCS are quantized, Bob generates parity bits, which are shared with Alice to help her correct the inconsistent bits in the quantized bits to generate the partial key. At the same time, the parity bits are used as frozen bits of polar codes in the multidimensional reconciliation (MR) to generate the other partial key. Simulation results demonstrate that the proposed twofold IR method increases the SKR nearly twice without increasing the inconsistent bits. In addition, we propose to apply symbol expansion and rotation (SER) based on the mapped GMCS to reduce the amount of information to be transmitted over the public error-free channel. Simulation results demonstrate that the performance of the proposed twofold IR with SER method can achieve a higher SKR with 3dB performance gap to that of the traditional MR protocol.