Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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

Kuang, Randy, Lou, Dafu, He, Alex, Conlon, Alexandre · 2021 · 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)

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

Crossref · 10.1109/icccs52626.2021.9449247

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 20 references

Research works printed but not linked: 2

  1. walker, 2008, ENT A Pseudorandom Number Sequence Test Program
  2. 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

See all 21

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
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
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.