Abstract
The usual cryptosystem behind debit card is RSA cryptosystem, which would be broken immediately by quantum computer. Thus, post-quantum cryptography rises and aims to develop cryptosystems which resist the quantum attack. Lattice-based cryptography is one on post-quantum cryptography, and is used to construct various cryptosystems. The central problem behind the lattice-based cryptosystem is Shortest Vector Problem (SVP), finding the shortest vector in the given lattice. Based on the previous results, we re-design the implementation method to improve the performance on GPU. Moreover, we implement and compare the enumeration and sieve algorithm to solve SVP on GPU. Thus, we can estimate the security parameter of lattice-based cryptosystem in reasonable way.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
