Quantum Cryptography Analysis for Secure Data Communication in Multi-Core Environment

Abstract

Compared to traditional computing methods, quantum computing's performance is a direct result of its foundation in quantum theory. It's a real benefit to academia and will cut computing times in half, from years to hours or minutes. Thus, quantum computers represent a significant risk to encryption because they create new dangers at an unparalleled pace and scale. When confronted by a quantum computer, conventional cryptographic techniques fail. However, particularly in a multi-core setting, there is a need for the design as well as development of cryptographic algorithms, which are safe from or resistant to the effects of quantum computing. In this paper, the advantages and disadvantages of the most popular quantum-safe cryptographic algorithms are described with an analysis of their performance on a multi-core machine. In this research, the efficiency of many possible quantum-safe algorithms, including multivariate, code-based, hash-based, and lattice-based algorithms, is analyzed. Most of quantum-safe algorithms need longer execution times and larger key sizes. In order to safeguard computers and networking in the post-quantum age, this work compares and analyses the performance of several post-quantum cryptographic methods.