TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Entropy diagnostics for cryptographic key material from random circuit sampling

, *

* Corresponding author · click or hover a name for details

pp. 1023–1032Vol. 29Issue 2-BFebruary 2026DOI: 10.47974/JDMSC-2641 Crossmark XML
Received:
07 May 2025
Published Online:
18 Feb 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2641
Pages:
1023–1032

Abstract

Random Circuit Sampling (RCS) has emerged as a leading paradigm for demonstrating quantum advantage. Beyond computational complexity, RCS provides a high-dimensional, chaotic probability distribution whose structure is characteristic of random unitary dynamics; here, we study its entropy properties in an ideal statevector baseline intended for later hardware validation. In this work, we present a reproducible validation framework for certifying cryptographic keys using a 12-qubit RCS ensemble (N = 4096 “ states” ) within an ideal quantum simulation framework. Unlike standard Quantum Random Number Generators (QRNGs), which often rely on single-qubit optics, our protocol utilises multi-qubit entanglement to ensure nonlocality. We quantify the security of the system using a dual-metric approach: basis-dependent Min-Entropy (H∞ ≈ 9.05 “ bits” ) for cryptographic extractability, and basis-independent Subsystem Von Neumann Entropy (S ≈ 3.96 bits) for quantum certification. We further demonstrate a privacy-amplification pipeline that uses a frequency-preserving, endian-corrected SHA-3 extraction to produce a 256-bit secure key (candidate key material). This study provides a transparent methodological bridge between the theoretical “Quantum Supremacy” regime and practical cryptographic key generation.

Keywords

Quantum random number generation (QRNG)Random circuit sampling (RCS)Entropic certificationMin-entropyQuantum entanglementPrivacy amplificationQuantum cryptography

Subject Classifications

11T71

References

[1] X. Ma, X. Yuan, Z. Cao, B. Qi, and Z. Zhang, “Quantum random number generation,” Rev Mod Phys, vol. 88, no. 1, pp. 15004 (2016), doi: 10.1103/RevModPhys.88.015004.
[2] M. Imran, A. B. Altamimi, W. Khan, S. Hussain, and M. Alsaffar, “Quantum cryptography for future networks security: A systematic review,” IEEE Access, vol. 12, pp. 180048–180078 (2024), doi: 10.1109/ACCESS.2024.3504815.
[3] M. S. Turan, E. Barker, J. Kelsey, K. A. McKay, M. L. Baish, and M. Boyle, “Recommendation for the entropy sources used for random bit generation,” (2018). doi: 10.6028/NIST.SP.800-90B.
[4] A. Nahum, J. Ruhman, S. Vijay, and J. Haah, “Quantum entanglement growth under random unitary dynamics,” Phys Rev X, vol. 7, no. 3, pp. 31016 (2017), doi: 10.1103/PhysRevX.7.031016.
[5] A. Acín and L. Masanes, “Certified randomness in quantum physics,” Nature, vol. 540, no. 7632, pp. 213–219 (2016), doi: 10.1038/nature20119.
[6] F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao , D. A. Buell, and B. Burkett, “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510 (2019), doi: 10.1038/s41586-019-1666-5.
[7] R. Shaltiel, “An introduction to randomness extractors,” in International Colloquium on Automata, Languages, and Programming, Berlin, Heidelberg: Springer, pp. 21–41 (2011). doi: 10.1007/978-3-642-22012-8_2.
[8] S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, “Characterizing quantum supremacy in near-term devices,” Nat Phys, vol. 14, no. 6, pp. 595–600 (Jun. 2018), doi: 10.1038/s41567-018-0124-x.
[9] A. Wehrl, “General properties of entropy,” Rev Mod Phys, vol. 50, no. 2, pp. 221–260 (1978), doi: 10.1103/RevModPhys.50.221.
[10] D. N. Page, “Average entropy of a subsystem,” Phys Rev Lett, vol. 71, no. 9, pp. 1291–1294 (1993), doi: 10.1103/PhysRevLett.71.1291.
[11] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).

Views: 127Downloads: 87Citations: 0