Shortest Distance Lattice Cryptographic Algorithm for Data Points Using Quantum Processors

Abstract

In this paper, a Lattice cryptographic algorithm has been proposed by computing the shortest distance between points in clusters. It classifies points which are dependent and independent. Subgrouping of these points as clusters are formed comprising of parent and multiple child points. Proximity based on similarity is computed as a measure of distance between points. The distance between parent points and child points are also computed and arranged in increasing order. Another subgrouping is made with the points based on this arrangement. This module is called as the cryptographic unit. Later data points are grouped separately and distances are computed for various combinations and arranged in increased. The points are encrypted and later decrypted based on simple matrix operations. The average processing time of SDL has been 55 s and it gives a reduction of 13% as compared to ECC and 23% as compared to RSA.