Abstract
In this paper, we propose a novel random sampling algorithm for the shortest vector problem (SVP) based on the y-sparse representations of the short lattice vectors. The experimental results show that the random sampling algorithm outperforms the other two SVP algorithms under the benchmarks of SVP challenge[1]. Therefore, the random sampling algorithm is an efficient SVP solver for the shortest vector problem.
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.
