Quantum permutation pad for quantum secure symmetric and asymmetric cryptography
Open accessAbstract
This review delves into the latest advancements in quantum-secure cryptography, focusing on the quantum permutation pad (QPP), a pivotal innovation proposed by Kuang et al. QPP harnesses the non-commutativity and generalized uncertainty derived from the Galois permutation group, making it highly suitable for cryptographic applications. The review underscores QPP’s versatility across both symmetric and asymmetric cryptography through three core representations: matrix-based for classical encryption, quantum gates for quantum-native encryption, and arithmetic-based for multivariate public key systems such as Merkle–Hellman cryptosystems, multivariate public key cryptography (MPKC), and the most recent homomorphic polynomial public key (HPPK). In particular, QPP strengthens the security of HPPK’s key encapsulation mechanism (KEM) and digital signature (DS) schemes, thus offering robust quantum resistance. This work further examines QPP’s integration with various encryption techniques for enhancing resilience against quantum attacks. By addressing challenges in cryptographic complexity, key size optimization, and security enhancement, the review presents a thorough evaluation of QPP’s role in fortifying cryptographic protocols for ensuring strong security foundations in the quantum computing era.
Integrity signals
Registry
Cites
Statistics
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?
QPP-RNG leverages repeated Fisher-Yates shuffles by permuting an array, recording the time to sort it, and using timing fluctuations shaped by CPU, cache, and memory interactions to extract raw entropy.
“QPP-RNG leverages the intrinsic complexity of repeated Fisher–Yates shuffles18: it permutes an array, records the time to sort it, and uses the timing fluctuations—shaped by fine-grained interactions across CPU, cache, and memory—to extract raw entropy.”
From Raw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation (2025) · cites this paper as [18]
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
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 · see citing works
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 · see citing works
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299 · see citing works
Weedbrook, C., Pirandola, S., García−Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,616 · see citing works
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047 · see citing works
Overcoming the rate–distance limit of quantum key distribution without quantum repeaters
Lucamarini, M., Yuan, Z. L., Dynes, J. F., & Shields, A. J. (2018) · Nature · doi:10.1038/s41586-018-0066-6 · Cited by 1,247 · see citing works
A new efficient algorithm for computing Gröbner bases (F4)
Faugère, J. (1999) · Journal of Pure and Applied Algebra · doi:10.1016/s0022-4049(99)00005-5 · Cited by 1,149 · see citing works
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,024 · see citing works
Hiding information and signatures in trapdoor knapsacks
Merkle, R. C., & Hellman, M. E. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 825 · see citing works
Twin-field quantum key distribution over 830-km fibre
Wang, S., Yin, Z.-Q., He, D.-Y., Chen, W., Wang, R.-Q., Ye, P., Zhou, Y., Fan-Yuan, G.-J., Wang, F., Chen, W., et al. (2022) · Nature Photonics · doi:10.1038/s41566-021-00928-2 · Cited by 541 · see citing works
Information-theoretic security proof for quantum-key-distribution protocols
Renner, R., Gisin, N., & Kraus, B. (2005) · Physical Review A · doi:10.1103/physreva.72.012332 · Cited by 521 · see citing works
Marsaglia, G. (2003) · Journal of Statistical Software · doi:10.18637/jss.v008.i14 · Cited by 427 · see citing works
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D. A., Dang, Q. H., Dang, T., Kelsey, J. M., Lichtinger, J., Liu, Y.-K., Miller, C. A., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 414 · see citing works
Statistical Tables for Biological Agricultural and Medical Research
Wishart, J. (1939) · Nature · doi:10.1038/144533a0 · Cited by 362 · see citing works
Experimental quantum key distribution beyond the repeaterless secret key capacity
Minder, M., Pittaluga, M., Roberts, G. L., Lucamarini, M., Dynes, J. F., Yuan, Z. L., & Shields, A. J. (2019) · Nature Photonics · doi:10.1038/s41566-019-0377-7 · Cited by 303 · see citing works
Chen, J.-P., Zhang, C., Liu, Y., Jiang, C., Zhang, W.-J., Han, Z.-Y., Ma, S.-Z., Hu, X.-L., Li, Y.-H., Liu, H., et al. (2021) · Nature Photonics · doi:10.1038/s41566-021-00828-5 · Cited by 294 · see citing works
Continuous-variable quantum cryptography using two-way quantum communication
Pirandola, S., Mancini, S., Lloyd, S., et al. (2008) · Nature Physics · doi:10.1038/nphys1018 · Cited by 272 · see citing works
Direct and Reverse Secret-Key Capacities of a Quantum Channel
Pirandola, S., García−Patrón, R., Braunstein, S. L., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.050503 · Cited by 250 · see citing works
The rise and fall of knapsack cryptosystems
Odlyzko, A. M. (1991) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/042/1095552 · Cited by 188 · see citing works
Ntru prime: Reducing attack surface at low cost
Bernstein, D. J., Chuengsatiansup, C., Lange, T., & van Vredendaal, C. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-72565-9_12 · Cited by 177 · see citing works
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems
Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R. A., Smith-Tone, D., Tillich, J., & Verbel, J. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64837-4_17 · Cited by 139 · see citing works
Scrambled Linear Pseudorandom Number Generators
Blackman, D., & Vigna, S. (2021) · ACM Transactions on Mathematical Software · doi:10.1145/3460772 · Cited by 133 · see citing works
Multivariate Public Key Cryptography
Ding, J., & Yang, B. (2009) · Springer eBooks · doi:10.1007/978-3-540-88702-7_6 · Cited by 115 · see citing works
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Adi Shamir, Z. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.5 · Cited by 108 · see citing works
Improved Cryptanalysis of UOV and Rainbow
Beullens, W. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77870-5_13 · Cited by 96 · see citing works
All in the XL Family: Theory and Practice
Yang, B., & Chen, J.-M. (2005) · Lecture notes in computer science · doi:10.1007/11496618_7 · Cited by 82 · see citing works
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45727-3_3 · Cited by 75 · see citing works
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC
Albrecht, M. R., Cid, C., Grassi, L., Khovratovich, D., Lüftenegger, R., Rechberger, C., & Schofnegger, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34618-8_13 · Cited by 74 · see citing works
Nguyen, P., & Stern, J. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052236 · Cited by 65 · see citing works
Melchor, C. A., Aragon, N., Bettaieb, S., et al. (2017) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 59 · see citing works
An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled
Vigna, S. (2016) · ACM Transactions on Mathematical Software · doi:10.1145/2845077 · Cited by 55 · see citing works
Knapsack Public Key Cryptosystems and Diophantine Approximation
Lagarias, J. C. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_1 · Cited by 49 · see citing works
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 41 · see citing works
Self-citationOptimized protocol for twin-field quantum key distribution
Wang, R., Yin, Z.-Q., Lu, F.-Y., et al. (2020) · Communications Physics · doi:10.1038/s42005-020-00415-0 · Cited by 39 · see citing works
A new quantum-safe multivariate polynomial public key digital signature algorithm
Kuang, R., Perepechaenko, M., & Barbeau, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-15843-x · Cited by 36 · see citing works
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 34 · see citing works
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 · see citing works
Self-citationPractical issues of twin-field quantum key distribution
Lu, F.-Y., Yin, Z., Wang, R., et al. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5a97 · Cited by 33 · see citing works
A public key cryptosystem based on three new provable problems
Su, S., & Lü, S. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.12.011 · Cited by 32 · see citing works
Recent progress in the security evaluation of multivariate public‐key cryptography
Ikematsu, Y., Nakamura, S., & Takagi, T. (2022) · IET Information Security · doi:10.1049/ise2.12092 · Cited by 32 · see citing works
Shannon Perfect Secrecy in a Discrete Hilbert Space
Kuang, R., & Bettenburg, N. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00039 · Cited by 26 · see citing works
Self-citationTwin-Field Quantum Key Distribution with Fully Discrete Phase Randomization
Currás-Lorenzo, G., Wooltorton, L., & Razavi, M. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014016 · Cited by 25 · see citing works
Bennett-Brassard 1984 quantum key distribution using conjugate homodyne detection
Qi, B. (2021) · Physical Review A · doi:10.1103/physreva.103.012606 · Cited by 24 · see citing works
A new post-quantum multivariate polynomial public key encapsulation algorithm
Kuang, R., Perepechaenko, M., & Barbeau, M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03712-5 · Cited by 24 · see citing works
Self-citationPseudo Quantum Random Number Generator with Quantum Permutation Pad
Kuang, R., Lou, D., He, A., McKenzie, C., & Redding, M. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00053 · Cited by 22 · see citing works
Self-citationRevisiting algebraic attacks on MinRank and on the rank decoding problem
Bardet, M., Briaud, P., Bros, M., Gaborit, P., & Tillich, J. (2023) · Designs Codes and Cryptography · doi:10.1007/s10623-023-01265-x · Cited by 22 · see citing works
Joux, A., & Vitse, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19074-2_23 · Cited by 19 · see citing works
Niemi, V. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_36 · Cited by 18 · see citing works
A multiple-iterated trapdoor for dense compact knapsacks
Orton, G. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053429 · Cited by 16 · see citing works
Quadratic compact knapsack public-key cryptosystem
Wang, B., & Hu, Y. (2009) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2009.08.031 · Cited by 16 · see citing works
Compiling Permutations for Superconducting QPUs
Soeken, M., Mozafari, F., Schmitt, B. D. O., & Micheli, G. D. (2019) · Design, Automation, and Test in Europe · doi:10.23919/date.2019.8715275 · Cited by 15 · see citing works
Quantum Circuits for the Unitary Permutation Problem
Facchini, S., & Perdrix, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17142-5_28 · Cited by 14 · see citing works
A New Knapsack Public-Key Cryptosystem Based On Permutation Combination Algorithm
Hwang, M., Lee, C., & Tzeng, S. (2009) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.1056018 · Cited by 12 · see citing works
Twin-field quantum key distribution with passive-decoy state
Teng, J., Lu, F.-Y., Yin, Z.-Q., et al. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abbab7 · Cited by 12 · see citing works
Benchmark Performance of Digital QKD Platform Using Quantum Permutation Pad
Lou, D., He, A., Redding, M., Geitz, M., Toth, R., Döring, R., Carson, R., & Kuang, R. (2022) · IEEE Access · doi:10.1109/access.2022.3212738 · Cited by 10 · see citing works
Self-citationDifferential-algebraic cryptanalysis of reduced-round of Serpent-256
Wang, M., Wang, X., & Hui, L. C. K. (2010) · Science China Information Sciences · doi:10.1007/s11432-010-0048-2 · Cited by 9 · see citing works
Recent Developments in Multivariate Public Key Cryptosystems
Hashimoto, Y. (2020) · Mathematics for industry · doi:10.1007/978-981-15-5191-8_16 · Cited by 9 · see citing works
The knapsack problem in cryptography
Qu, M. H., & Vanstone, S. A. (1994) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/168/01708 · Cited by 9 · see citing works
Deployment-Oriented Integration of DV-QKD and 100G Optical Transmission System
Lai, J., Lin, X., Qian, Y., et al. (2019) · Cited by 8 · see citing works
Djordjević, I. B. (2019) · Springer eBooks · doi:10.1007/978-3-030-27565-5_7 · Cited by 7 · see citing works
Kuang, R., & Perepechaenko, M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04064-4 · Cited by 7 · see citing works
Self-citationA new class of cryptosystems based on Chinese remainder theorem
Murakami, Y., Katayanagi, K., & Kasahara, M. (2008) · International Symposium on Information Theory and its Applications · doi:10.1109/isita.2008.4895587 · Cited by 6 · see citing works
New Attacks for Knapsack Based Cryptosystems
Herold, G., & Meurer, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32928-9_18 · Cited by 5 · see citing works
Analysis of two knapsack public key cryptosystems
Peng, L., Hu, L., Xu, J., et al. (2013) · IET Communications · doi:10.1049/iet-com.2013.0180 · Cited by 4 · see citing works
Quam Bene Non Quantum: Bias in a Family of Quantum Random Number Generators.Preprint
Hurley-Smith, D., & Hernandez-Castro, J. C. (2017) · IACR Cryptology ePrint Archive · Cited by 4 · see citing works
Homomorphic polynomial public key with the Barrett transformation for digital signature
Kuang, R., Perepechaenko, M., Sayed, M. F., & Lou, D. (2024) · Academia quantum. · doi:10.20935/acadquant7353 · Cited by 4 · see citing works
Self-citationBarbeau, M. (2023) · F1000Research · doi:10.12688/f1000research.140027.1 · Cited by 3 · see citing works
Algebraic-Differential Attacks on a Family of Arithmetization-Oriented Symmetric Ciphers
Li, Z., Wu, B., & Lin, D. (2023) · Journal of Systems Science and Complexity · doi:10.1007/s11424-023-1511-7 · Cited by 3 · see citing works
Cryptanalysis of two knapsack public-key cryptosystems.
Bi, J., Han, L., & Meng, X. (2009) · Cited by 1 · see citing works
Quantum complexity of permutations
Yu, A. T. (2023) · Pure and Applied Mathematics Quarterly · doi:10.4310/pamq.2023.v19.n2.a6 · Cited by 1 · see citing works
Cryptanalysis of quantum permutation padPreprint
Amil, A., & Gupta, S. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2304.11081 · Cited by 1 · see citing works
A chosen-plaintext attack on quantum permutation pad
Zawadzki, P. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04278-0 · Cited by 1 · see citing works
Quantum Permutation Pad with Qiskit Runtime
Chancé, A. (2024) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-59619-3_12 · Cited by 1 · see citing works
Realization of permutation groups by quantum circuitPreprint
Liu, J., Ren, Y., Cao, Y., et al. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2406.01350 · Cited by 1 · see citing works
A Permutation Dispatch Circuit Design for Quantum Permutation Pad Symmetric Encryption
Burge, I., Thong, M., & Barbeau, M. (2024) · International Conference on Communications, Circuits and Systems · doi:10.1109/icccas62034.2024.10652827 · Cited by 1 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Raw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation
Vrana, G., Lou, D., & Kuang, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-13135-8 · Cited by 5 · see citing works
Self-citation
- Authors
- Kuang, R.
- Affiliations
- Quantropi (Canada) (CA)
- Corresponding author
- Kuang, Randy
- ORCID
- Kuang, Randy
- Venue
- Academia Quantum
- Publisher
- Academia.edu Journals
- Published
- 2025-01-03
- Volume
- 2
- Issue
- 1
- ISSN
- 3064-979X (ISSN-L)
- OpenAlex
- W4406049530
- Cited by
- 4
- References
- 77
- Citations by year
- 2026: 1 · 2025: 3
- FWCI
- 1.62
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- cc-by
- Locations
- Academia quantum. (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- non-commutativity, symmetric encryption, public-key cryptography, multivariate public-key cryptography, Merkle-Hellman cryptosystem, key encapsulation mechanism, digital signatures, post-quantum security, quantum resistance
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
