随机性
随机排列
伪随机置换
排列(音乐)
熵(时间箭头)
位反转置换
计算机科学
离散数学
数学
理论计算机科学
置换图
算法
对称群
量子力学
统计
物理
声学
图形
作者
Dafu Lou,Randy Kuang,Alex He
标识
DOI:10.1109/icct52962.2021.9657891
摘要
This paper proposes a quantum safe solution for 5G networks using a quantum permutation pad (or QPP) algorithm, originated from quantum computing logic gates or quantum permutation gates. All permutation gates form a unique permutation space, just like a classical key space. An n-bit permutation space consists of the entire 2 n ! permutation gates, or permutation matrices over its computational basis. The huge equivalent Shannon entropy of this permutation space would be a nice entropy source for information security. Kuang and Bettenburg in 2020 first proposed QPP and proved it to be the Shannon type of perfect secrecy. Here, we extend its capability of entropy transformations for distribution over the Internet to entropy expansions for 5G networks. We analyze the randomnesses following transformations and expansions with QPP, using industry randomness testing suites. Testing results confirm that QPP can maintain the original randomness of QRNG random numbers for transformations and expansions. Leveraging its strong diffusion capability, QPP may also improve the byte-level randomness of input random numbers.
科研通智能强力驱动
Strongly Powered by AbleSci AI