Abstract

The security of lattice-based cryptosystems in postquantum cryptography is mainly based on the difficulty of solving the shortest vector problem (SVP) or the closest vector problem (CVP). In this paper, efficient implementations of GaussSieve and ProGaussSieve algorithms alternatives to solve the shortest vector problem are studied. A cryptographic software library is developed which is an infrastructure for the implementation of sieving algorithms in order to have faster running times than the ones in the literature. In addition, a comparison table including the running times of the implementations of GaussSieve and ProGaussSieve algorithms is presented. According to the experimental results, the proposed GaussSieve and ProGaussSieve implementations are much more faster and efficient than the others.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.