The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Quantum Safe Lightweight Cryptography with Quantum Permutation Pad
Abstract
Quantum permutation pad or QPP was first proposed by Kuang and Bettenburg in 2020 [15]. QPP is a generic quantum algorithm consisting of multiple n-qubits quantum permutation gates. As a quantum algorithm, QPP can be implemented both in a quantum computing system as a quantum circuit operating on n-qubits' state for transformation and in a classical computing system represented by a pad of n-bit permutation matrices. QPP has two unique characteristics: huge Shannon information entropy and non-commutativity between permutation matrices or the generalized uncertainty principal. Permutation transformation is bijective mapping between input information space and output ciphertext space. That means, QPP has the property of Shannon perfect secrecy with reusability due to the uncertainty relationship. QPP is the generalization of One-Time-Pad or OTP over Hilbert space and OTP is the simplification of QPP over a Galois field. Based on those, this paper explores a variant of AES for a quantum safe lightweight cryptography by incorporating AES ShiftRows and MixColumns with QPP or called AES-QPP. AES-QPP unifies the SubBytes and AddRoundKey with the same QPP of 16 8-bit permutation matrices, essentially SubBytes to be a special 8-bit permutation matrix and AddRoundKey to be 16 8-bit permutation matrices selected from XOR operations. By randomly selecting 16 permutation matrices with a secret key material, AES-QPP could hold a total equivalent 26,944 bits of Shannon entropy. It not only improves the security against differential and linear attacks but also largely reduces the number of rounds to 5 rounds. AES-QPP could be a good candidate for quantum safe lightweight cryptography.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In view of this, recent research works [111] and [112] have attempted to design quantum safe lightweight cryptosystems using quantum permutation pads.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [112]
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“Kuang and Bettenburg [15] successfully extend the Shannon perfect secrecy of the classical one-timepad (OTP) over GF(2n) [16], to their proposed quantum permutation pad (QPP) over a quantum computational basis.”
BackgroundA fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
The design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Synthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
Quantum Security Analysis of AES
Bonnetain, X., Naya-Plasencia, M., & Schrottenloher, A. (2019) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2019.i2.55-93 · Cited by 173
New Impossible Differential Attacks on AES
Lu, J., Dunkelman, O., Keller, N., & Kim, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89754-5_22 · Cited by 146
Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis
Heys, H. M., & Tavares, S. E. (1996) · Journal of Cryptology · doi:10.1007/bf02254789 · Cited by 100
Prime factorization algorithm based on parameter optimization of Ising model
Wang, B., Hu, F., Yao, H., & Wang, C. (2020) · Scientific Reports · doi:10.1038/s41598-020-62802-5 · Cited by 87
Research works printed but not linked: 2
- walker, 2008, ENT A Pseudorandom Number Sequence Test Program
- 2012, Announcing the ADVANCED ENCRYPTION STANDARD (AES), Federal Information Processing Standards Publication 197 United States National Institute of Standards and Technology (NIST) November 26 2001 Archived (PDF) from the original on March 12 2017
Cited by
Zero Trust Architecture (ZTA): A Comprehensive Survey
Syed, N. F., Shah, S. W., Shaghaghi, A., Anwar, A., Baig, Z., & Doss, R. (2022) · IEEE Access · doi:10.1109/access.2022.3174679 · Cited by 406
“In view of this, recent research works [111], [112] have attempted to design quantum safe lightweight cryptosystems using quantum permutation pads.”
BackgroundLightweight block ciphers for resource-constrained environments: A comprehensive survey
Zhong, Y. Q., & Gu, J. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.03.054 · Cited by 66
Quantum permutation pad for universal quantum-safe cryptography
Kuang, R., & Barbeau, M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03557-y · Cited by 53
Self-citationQuantum encryption with quantum permutation pad in IBMQ systems
Kuang, R., & Perepechaenko, M. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00145-y · Cited by 42
Self-citationQuantum encryption of superposition states with quantum permutation pad in IBM quantum computers
Perepechaenko, M., & Kuang, R. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00164-3 · Cited by 34
Self-citation
Metadata
- Authors
- Kuang, R., Lou, D., He, A., & Conlon, A.
- Affiliations
- Quantropi (Canada) (CA)
- Venue
- 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)
- Publisher
- IEEE
- Published
- 2021-04-23
- Pages
- 790-795
- OpenAlex
- W3174272245
- Semantic Scholar
- 9212acf781ca3bb154c66ecc653bb5c62958b4ef
- Cited by
- 21
- References
- 20
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 3 · 2023: 4 · 2022: 5 · 2021: 3
- FWCI
- 1.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- International Conference on Computer and Communication Systems (ICCCS) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- post-quantum cryptography, lightweight cryptography, one-time pad, permutation matrices, Shannon entropy, perfect secrecy, SubBytes, MixColumns, ShiftRows
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Safe Lightweight Cryptography with Quantum Permutation Pad. https://app.cochat.ai/papers/10.1109/icccs52626.2021.9449247
- The paper
- Kuang, R., Lou, D., He, A., & Conlon, A. (2021). Quantum Safe Lightweight Cryptography with Quantum Permutation Pad. 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS). https://doi.org/10.1109/icccs52626.2021.9449247
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.