You are looking at a specific version 20141207:153158 of this paper.
See the latest version.
Paper 2014/980
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors
Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng
Abstract
In this paper, we propose a new phase-based enumeration algorithm based on two interesting and useful observations for y-sparse representations of short lattice vectors in lattices from SVP challenge benchmarks. Experimental results show that the phase-based algorithm greatly outperforms other famous enumeration algorithms in running time and achieves higher dimensions, like the Kannan-Helfrich enumeration algorithm. Therefore, the phase-based algorithm is a practically excellent solver for the shortest vector problem (SVP).
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. ICISC 2014
- Keywords
- Lattice-based Xryptography
- Contact author(s)
- dingd09 @ mails tsinghuaa edu cn
- History
- 2014-12-07: received
- Short URL
- https://ia.cr/2014/980
- License
-
CC BY