The emergence of quantum computing introduce a transformative era that challenges several classical deterministic processes. Among those profoundly affected is cryptography, where the prowess of quantum computers inches closer to the theoretical limits of classical encryption methods. Within cryptography random numbers play a pivotal role. Our work takes a non-conventional approach to generate random numbers by introducing the concept of inherent randomness present in quantum computation. Leveraging this unique feature, we have designed a novel seed-generation quantum algorithm. This quantum algorithm seamlessly integrates with existing random number generation techniques, bridging the quantum and classical worlds. To validate the effectiveness of our approach, we subjected the generated random numbers to rigorous testing using a standardized randomness test algorithm. The obtained results substantiate our claim that the inherent randomness in the quantum measurement of the superposition state indeed can generate robust and high-quality seed values, marking a significant advancement in the field of random number generation.