학술논문

Pseudo Random Binary Sequence using Lattice-based Hard Problem for Quantum Key Distribution
Document Type
Conference
Source
2023 IEEE International Carnahan Conference on Security Technology (ICCST) Security Technology (ICCST), 2023 IEEE International Carnahan Conference on. :1-7 Oct, 2023
Subject
Aerospace
Communication, Networking and Broadcast Technologies
Computing and Processing
Engineering Profession
General Topics for Engineers
Signal Processing and Analysis
Transportation
Natural resources
Statistical analysis
Receivers
NIST
Generators
Entropy
Quantum key distribution
Lattice-Based Cryptography
Linear Feedback Shift Register
Learning with Error
NIST Statistical Test Suite
Pseudo Random Binary Sequence
Language
ISSN
2153-0742
Abstract
Recently, there has been a growing interest among researchers in Pseudo-Random Binary Sequences (PRBS) for Quantum Key Distribution (QKD). QKD is a cryptographic protocol that distributes secret keys between senders and receivers, relying on random numbers to determine the basis for evaluating transmitted bits. Quantum Random Number Generators (QRNG) utilizing natural resources create random bit sequences for QKD. However, QRNGs are susceptible to natural noise, which compromises their security. Additionally, post-processing of QRNG-generated sequences is necessary to reduce noise, but this process slows down the random number generation speed in QKD. Non-deterministic Pseudo-Random Sequence Generators (ND-PRSG) may overcome the QRNG's constraints, post-processing, and speed. Lattice-based NDPRSG provides security and efficiency. The proposed work focuses on generating a uniform PRBS with non-deterministic entropy using Learning with Errors (LWE) and LFSR. NIST Statistical Tests are performed on generated PRBS for randomness analysis, and the results are reported. The proposed PRBS generation can be used for QKD, operating up to 20.17 Mbit/s.