Optimal Parameter Prediction for Secure Quantum Key Distribution Using Quantum Machine Learning Models

Optimal Parameter Prediction for Secure Quantum Key Distribution Using Quantum Machine Learning Models

Sathish Babu B., K. Bhargavi, K. N. Subramanya
Copyright: © 2020 |Pages: 26
DOI: 10.4018/978-1-7998-2253-0.ch003
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The advent of quantum computing is bringing threats to successful operations of classical cryptographic techniques. To conduct quantum key distribution (QKD) in a finite time interval, there is a need to estimate photon states and analyze the fluctuations statistically. The use of brute force and local search methods for parameter optimization are computationally intensive and becomes an infeasible solution even for smaller connections. Therefore, the use of quantum machine learning models with self-learning ability is useful in predicting the optimal parameters for quantum key distribution. This chapter discusses some of the quantum machine learning models with their architecture, advantages, and disadvantages. The performance of quantum convoluted neural network (QCNN) and Quantum Particle Swarm Optimization (QPSO) towards QKD is found to be good compared to all the other quantum machine learning models discussed.
Chapter Preview
Top

Introduction

Today’s e-manufacturing, digital world provides a variety of services for the benefit of mankind, which includes e-Health, e-Bank, e-Hotel, e-Government and e-Commerce. For successful operation of these services several factors, like privacy, security, confidentiality, cost, trust, compatibility, and standardization. need to be taken into account. Among all the factors security is given paramount importance as the data being exchanged need to be protected from third party attacks. Traditional cryptography is one of the methods that allow us to store and send the data via encryption and reverse decryption process and established secure communication between two parties by protecting the data from attackers using public and private key distribution strategies (Van & Thijssen, 2015).

Some of the consequences of traditional cryptography are listed below.

  • The message which is strongly authenticated using cryptographic mechanism sometimes makes it difficult to take legitimate decisions at crucial time.

  • The speed of execution slows down due to complex mathematical operations.

  • Providing selective access to the data is difficult suing crypto system.

  • The design of the crypto system is poor in terms of architecture, protocol, and procedures used for encoding and decoding.

  • Cost of setup and operation of public key cryptosystem is high as it demands separate public key infrastructure.

Top

Quantum Computing: An Overview

Quantum computing is a revolutionary technology which leverages the characteristics of quantum mechanics such as superposition and entanglement to perform computation extremely faster than classical computing technologies (Feynman, 1982).

Figure 1.

Quantum computing process

978-1-7998-2253-0.ch003.f01

Many forms of quantum technologies are already in use, out of which quantum key distribution has been pioneered by using commercially available quantum computers. Quantum sensors and actuators are allowing scientists to work at nano-scale levels with remarkably higher precision and sensitivity. Development of quantum processors is another main stream activity which is seriously taken up by some of the top-notch technology companies. A generic representation of quantum computing process is given in figure 1, consists of quantum states whose output is processed by quantum gates to yield quantum outputs.

The advent of quantum computers is bringing in the following threats to successful operations of classical cryptographic techniques.

  • Classical cryptographic algorithms rely on the complexity of the mathematical function used for encryption and decryption, which can be easily tackled by quantum computers using photon properties.

  • Shors quantum computer algorithm is an attack on asymmetric cryptographic algorithms as it can easily find prime factors for the given integer (Yimsiriwattana & Lomonaco, 2004).

  • Grover’s quantum computing algorithm weakens symmetric cryptographic algorithms as it can determine the unique input to a black box output generating function using 978-1-7998-2253-0.ch003.m01 function evaluation, where N represent the size of the evaluation function (Zalka, 1999).

  • Quantum hacking affects the security and privacy of key agreement-based protocols like Diffie–Hellman (DH), and Menezes–Qu–Vanstone (MQV) through photon polarization.

  • Encryption algorithms like Rivest-Shamir-Adleman (RSA), Digital Signature Algorithm (DSA), and elliptic curve cryptography (ECC) are breakable as a quantum computer can easily factor the large keys.

Complete Chapter List

Search this Book:
Reset