Visible to the public Biblio

Filters: Author is Khan, Ajoy Kumar  [Clear All Filters]
2022-07-14
Adhikari, Tinku, Ghosh, Arindam, Khan, Ajoy Kumar, Laha, Swarnalina, Mitra, Purbita, Karmakar, Raja.  2021.  Quantum Resistance for Cryptographic Keys in Classical Cryptosystems: A Study on QKD Protocols. 2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT). :1—7.
Distribution of keys in classical cryptography is one of the most significant affairs to deal with. The computational hardness is the fundamental basis of the security of these keys. However, in the era of quantum computing, quantum computers can break down these keys with their substantially more computation capability than normal computers. For instance, a quantum computer can easily break down RSA or ECC in polynomial time. In order to make the keys quantum resistant, Quantum Key Distribution (QKD) is developed to enforce security of the classical cryptographic keys from the attack of quantum computers. By using quantum mechanics, QKD can reinforce the durability of the keys of classical cryptography, which were practically unbreakable during the pre-quantum era. Thus, an extensive study is required to understand the importance of QKD to make the classical cryptographic key distributions secure against both classical and quantum computers. Therefore, in this paper, we discuss trends and limitations of key management protocols in classical cryptography, and demonstrates a relative study of different QKD protocols. In addition, we highlight the security implementation aspects of QKD, which lead to the solution of threats occurring in a quantum computing scenario, such that the cryptographic keys can be quantum resistant.