Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Sebastian, Eby; Poonia, Ramesh Chandra Title A name given to the resource Entropy diagnostics for cryptographic key material from random circuit sampling Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Journal of Discrete Mathematical Sciences and Cryptography;Volume;29;Issue;2;pp.1023-1032 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.47974/JDMSC-2641" target="_blank" rel="noreferrer noopener">https://doi.org/10.47974/JDMSC-2641</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105031570406?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105031570406?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Sebastian E., Department of Computer Science, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Poonia R.C., Department of Computer Science, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource 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. 2026, Taru Publications. All rights reserved. Subject The topic of the resource Entropic certification; Min-entropy; Privacy amplification; Quantum cryptography; Quantum entanglement; Quantum random number generation (QRNG); Random circuit sampling (RCS) Publisher An entity responsible for making the resource available Taru Publications Relation A related resource ISSN: 9720529; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online