<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2641</article-id>
      <title-group>
        <article-title>Entropy diagnostics for cryptographic key material from random circuit sampling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Sebastian</surname>
            <given-names>Eby</given-names>
          </name>
          <aff>Department of Computer Science, CHRIST (Deemed to be University), Bangalore, Karnataka, 560029, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Poonia</surname>
            <given-names>Ramesh Chandra</given-names>
          </name>
          <aff>Department of Computer Science, CHRIST (Deemed to be University), Bangalore, Karnataka, 560029, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>2-B</issue>
      <fpage>1023</fpage>
      <lpage>1032</lpage>
      <pub-date date-type="pub">
        <day>18</day>
        <month>02</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Quantum random number generation (QRNG)</kwd>
        <kwd>Random circuit sampling (RCS)</kwd>
        <kwd>Entropic certification</kwd>
        <kwd>Min-entropy</kwd>
        <kwd>Quantum entanglement</kwd>
        <kwd>Privacy amplification</kwd>
        <kwd>Quantum cryptography</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
