Quantum Computing: The Future of Secure Data Encryption and Problem Solving
Chennakeshi Ganesh, Shahanawaj Ahamad, Vivek Veeraiah, K O Thejaswini, Sheetal Pradip Patil, Arpit Namdev · 2024
Data encryption and challenging problemsolving might be transformed by quantum computing This research suggests that the ability of quantum computers to examine enormous amounts of data at hitherto unheard-of speeds may revolutionize optimization and encryption. For post-quantum data security, quantum cryptography—more especially, QKD-offers perfect encryption. The study also looks at quantum algorithms like Grover's and Shor's, which ten-fold faster than traditional computers solve. Additionally discussed are quantum hardware development concerns and how they affect military, finance, and healthcare. This work implements Python's conventional and quantum encryption using Qiskit. Security, encryption/decryption time, key management/distribution complexity, and mistake rate are evaluated among AES, DES, RSA, and QKD. Future-proof security would find QKD ideal given its classical and quantum resistance. RSA and AES both fight cryptanalysis and bruteforce. From conventional assaults, RSA is secure; yet, quantum threats such as Shor's method could compromise it. With its 56-bit key length unsuitable for contemporary encryption, DES receives the lowest security score. The most effective is AES as it encrypts and decodes fast and cheaply. DES lacks security, hence it is unsuitable for current uses even if it is efficient. RSA is inefficient as larger key sizes impede encryption and decoding. Third in efficiency is QKD because of overhead and quantum channel key distribution complexity. Though key distribution is slower than in AES and DES, it is safer. The comparison reveals for every method security, efficiency, and error rate advantages as well as drawbacks.