Quantum entropy expansion using n-qubit permutation matrices in Galois field
Abstract
Random numbers are critical for any cryptographic application. However, the data that is flowing through the internet is not secure because of entropy deprived pseudo random number generators and unencrypted IoTs. In this work, we address the issue of lesser entropy of several data formats. Specifically, we use the large information space associated with the n-qubit permutation matrices to expand the entropy of any data without increasing the size of the data. We take English text with the entropy in the range 4 - 5 bits per byte. We manipulate the data using a set of n-qubit (n 10) permutation matrices and observe the expansion of the entropy in the manipulated data (to more than 7.9 bits per byte). We also observe similar behaviour with other data formats like image, audio etc. (n 15).
Keywords
Cite
@article{arxiv.2207.07148,
title = {Quantum entropy expansion using n-qubit permutation matrices in Galois field},
author = {Avval Amil and Shashank Gupta},
journal= {arXiv preprint arXiv:2207.07148},
year = {2022}
}