Security and privacy in post-quantum blockchain using hybrid approach of subsets in SVP within lattice-based cryptography

This article addresses the challenges in improving the efficiency of solving the lattice-based cryptographic, Shortest Vector Problem (SVP), which is a crucial element to improve the security against the potential quantum attacks. We present a novel algorithm that integrates the concept of subsets generation with the SVP to enhance the efficiency of the lattice-based cryptographic schemes. This research delivers advancement by providing a more efficient method of solving the SVP. The method in this paper contributes towards the development of the security and privacy in cryptographic systems in the post-quantum era, surfacing the way for a vigorous encryption protocol.