Abstract
The learning with errors (LWE) problem is one of the hard problems assuring the security of modern lattice-based cryptography. Kannan’s embedding can reduce Search-LWE, the search version of LWE, to a specific case of the shortest vector problem (SVP). Lattice basis reduction is a powerful instrument for solving lattice problems including SVP. We propose a new way for efficiently solving Search-LWE. While a whole basis is reduced in a standard way, ours reduces only a projected basis. To realize our strategy, we also provide an algorithm for reducing projected bases, based on DeepBKZ that is an enhancement of the block Korkine–Zolotarev (BKZ) algorithm. Moreover, we show implementation results for solving some instances within the Darmstadt LWE challenge.
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.
