Table 23 Advantages of the proposed method over existing methods.
From: Quantum secure image encryption using hybrid QTRNG and QPRNG
Method | Encryption Technique | Randomness Source | Robustness analysis | Quantum Hardware Feasibility | Advantages of the Proposed Method |
|---|---|---|---|---|---|
DNA encoding and CNOT-based scrambling | Pseudo-random classical DNA encoding | Moderate NPCR/UACI, entropy not optimal | Simulated only | Lacks quantum randomness and hardware support; the proposed method uses QHRNG and real hardware testing | |
Fractional wavelet, chaotic system and quantum transform | Classical chaos and mathematical transforms | Theoretical robustness; limited attack testing | Purely theoretical model | No real quantum implementation or randomness; proposed method integrates real QTRNG and QPRNG | |
2D quantum walk and quantum coding | Quantum walk patterns | High diffusion, theoretical analysis | No hardware implementation | High circuit complexity, no entropy or plaintext attack testing; proposed method shows hardware feasibility and full attack analysis | |
Bit-plane permutation and sine logistic map | Classical chaotic maps | Moderate NPCR/UACI, entropy not near ideal | Fully classical model | No quantum integration; proposed method uses selective QFT and quantum gates compatible with NISQ | |
Proposed Method | QHRNG key (QTRNG and QPRNG), Quantum bit-level scrambling, selective QFT and parallel processing. | True and pseudo quantum randomness (QHRNG) | NPCR > 99.5%, UACI ~ 33.5%, Entropy ~ 7.99, Avalanche effect ~ 50%, chi-square, PSNR and correlation ~ low, MSE ~ high | Implemented on IBM Qiskit Noisy and Noiseless simulations and real quantum hardware implementation of QHRNG | Combines QTRNG and QPRNG achieves high entropy, strong resistance to attack models supports real-time quantum hardware with polynomial complexity |
