Abstract
Sieve algorithm plays an important role in solving the shortest vector problem, which is one of the most representative hard lattice problems. In this paper, we propose an efficient sieve algorithm with evolutionary techniques. By combining Gauss Sieve algorithm with global selection, we propose an efficient sieve algorithm. Experimental results show that our algorithm performs better than FPLLL’s Gauss Sieve algorithm in solving the shortest vector problem. Furthermore, we explore how mutation behaves in accelerating sieve algorithm.
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.
