Time-bin phase-encoding quantum key distribution using Sagnac-based optics and compatible electronics.

In this work, we present a new time-bin phase-encoding quantum key distribution (QKD), where the transmitter utilizes an inherently stable Sagnac-type interferometer, and has comparable electrical requirements to existing polarization or phase encoding schemes. This approach does not require intensity calibration and is insensitive to environmental disturbances, making it both flexible and high-performing. We conducted experiments with a compact QKD system to demonstrate the stability and secure key rate performance of the presented scheme. The results show a typical secure key rate of 6.2 kbps@20 dB and 0.4 kbps@30 dB with channel loss emulated by variable optical attenuators. A continuous test of 120-km fiber spool shows a stable quantum bit error rate of the time-bin basis within 0.4%∼0.6% over a consecutive 9-day period without any adjustment. This intrinsically stable and compatible scheme of time-bin phase encoding is extensively applicable in various QKD experiments, including BB84 and measurement-device-independent QKD.

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA.

In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of processing data at faster speeds. The Secure Hash Algorithm (SHA), which functions as a cryptographic hash function, is a key technology in digital authentication. Irreducible polynomials can serve as characteristic functions of the Linear Feedback Shift Register (LFSR) to rapidly generate pseudo-random sequences, which in turn form the foundation of the hash algorithm. Currently, the most prevalent approach to hardware implementation involves performing block computations and pipeline data processing of the Toeplitz matrix in the Field-Programmable Gate Array (FPGA) to reach a maximum computing rate of 1 Gbps. However, this approach employs a fixed irreducible polynomial as the characteristic polynomial of the LFSR, which results in computational inefficiency as the highest bit of the polynomial restricts the width of parallel processing. Moreover, an attacker could deduce the irreducible polynomials utilized by an algorithm based on the output results, creating a serious concealed security risk. This paper proposes a method to use FPGA to implement variational irreducible polynomials based on a hashing algorithm. Our method achieves an operational rate of 6.8 Gbps by computing equivalent polynomials and updating the Toeplitz matrix with pipeline operations in real-time, which accelerates the authentication protocol while also significantly enhancing its security. Moreover, the optimization of this algorithm can be extended to quantum randomness extraction, leading to a considerable increase in the generation rate of random numbers.

A simulation study of the DQE of a linear plastic scintillating fiber array for hard gamma-rays.

The detector quantum efficiency (DQE) of a linear plastic scintillating fiber (PSF) array coupled with a charge-coupled device (CCD) for hard gamma-ray imaging is studied using a Monte Carlo simulation. The focus is on the energy from a few MeV to about 12 MeV. The excellent characteristic of PSF offers a method to balance the detection efficiency and spatial resolution. Our simulation results indicate that the modulation transfer function (MTF) for different energies become almost the same below the certain frequency and the DQE should be better at lower frequency for imaging lower incident energy. These characteristics suggest that the PSF may be useful for detecting high energy gamma-rays.