arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.03024cs.CRcs.ET
收藏

用于量子密钥分发的非确定性伪随机生成器

Non Deterministic Pseudorandom Generator for Quantum Key Distribution

Arun Mishra, Kanaka Raju Pandiri, Anupama Arjun Pandit, Lucy Sharma

AI总结:

针对量子随机数生成器需大量后处理才能产出可用均匀比特的瓶颈,本研究提出基于后量子格困难问题LWE的非确定性伪随机生成器,利用其高斯误差的非确定性满足QKD的熵要求,且速度更快,经Die-Harder测试验证有效性。

摘要:

量子密钥分发(Quantum Key Distribution,QKD)致力于通过量子过程实现一次性密码本(One time Pad,OTP)的完美保密性。QKD的核心组件之一是用于生成密钥的量子随机数生成器(Quantum Random Number Generators,QRNG)。遗憾的是,这类QRNG无法直接生成可用比特,而是产出熵值高但均匀性低的原始比特,几乎无法被任何密码系统直接使用。QRNG生成的随机数需要经过大量预处理才能投入使用,这不仅成为随机数生成速率的瓶颈,也制约了依赖它的QKD系统的性能。为弥补当前作为QRNG核心环节的后处理方法的不足,研究人员探索了满足熵(非确定性)要求与量子安全性的替代方案。基于量子安全基元的伪随机生成器可作为后处理问题的替代解法,因为伪随机数生成器(Pseudorandom Number Generators,PRNG)的运行速度远快于任何采用物理随机性(QRNG中的量子力学过程)的随机数生成器,同时还能提供密码学应用所需的均匀比特。本研究提出了一种基于后量子基元的伪随机生成器。该随机数生成器的核心思路是设计具备非确定性熵的PRNG,其熵通过格困难问题——带错学习(Learning with errors,LWE)生成。我们利用LWE的高斯误差带来的非确定性,构建满足QKD熵需求的非确定性PRNG。最后,本文通过Die-Harder测试对该PRNG进行了评估并得出结论。

英文摘要:

Quantum Key Distribution(QKD) thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. Unfortunately, these QRNG does not immediately produce usable bits rather it produces raw bits with high entropy but low uniformity which can be hardly used by any cryptographic system. A lot of pre-processing is required before the random numbers generated by QRNG to be usable. This causes a bottle neck in random number generation rate as well as QKD system relying on it. To avoid this lacuna of post-processing methods employed as a central part of Quantum Random Number Generators alternative approaches that satisfy the entropy(non determinism) and quantum security is explored. Pseudorandom generators based on quantum secure primitives could be an alternative to the post-processing problem as PRNGs are way more faster than any random number generator employing physical randomness (quantum mechanical process in QRNG) as well as it can provide uniform bits required for cryptography application. In this work we propose a pseudorandom generator based on post quantum primitives. The central theme of this random number generator is designing PRNG with non deterministic entropy generated through hard lattice problem - Learning with errors. We leverage the non determinism by Gaussian errors of LWE to construct non-deterministic PRNG satisfying the entropy requirement of QKD. Further, the paper concludes by evaluating the PRNG through Die-Harder Test.

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

↑