.png){kind=icon}
.png){kind=icon}
返回
Efficient Quantum Algorithm for Post Quantum Cryptography
.png){kind=icon}
PRE
AI
DOI：10.3791/68934.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The realization of Quantum computers could significantly affect society and global security in many ways. A considerable amount of research has been on quantum cryptography-machines that exploit quantum computerized sensations to solve mathematical problems inaccessible to conventional computers. The flourishing 6th generation of 'Quantum computing' can break and threaten much of the current established protection and digital economy, but may provide cryptographic alternatives. Thus, we are able to optimize various processes more effectively, improving efficiency and enabling faster quantum mechanical simulations for better drug and material design, among other applications. This research focuses on implementing a post-quantum cryptographic algorithm by connecting large-number Quantum multiplication with a quantum random number generator (QRNG). A code-based cryptographic approach using a Quantum Fourier Transformation (QFT) is taken with a giant asymmetric key in an explicit quantum circuit to establish a secure quantum communication system. In this research work, a 'plain text' (classical data) has been encrypted with QRNG using a Quantum multiplier with the aid of quantum arithmetic. Consequently, the resultant quantum data with QRNG data will be transmitted to the receiver end through the quantum channel, where the quantum divider decrypts the same. Furthermore, each intended component's IBM Qiskit simulation results and comparative analysis with previous works and algorithms suggest more robustness and reliability of the proposed quantum proof algorithm when considering large qubit quantum devices. The work provides a valuable direction for further developments in this domain and paves the way for future applications of quantum computing in post-quantum cryptography.
查看更多机构