搜索结果: 1-4 共查到“密码学 Pruning”相关记录4条 . 查询时间(0.048 秒)
Lower Bounds on Lattice Enumeration with Extreme Pruning
Lattices Enumeration Pruning Security Estimates
2018/6/13
At Eurocrypt '10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm is implemented in state-of-the-art lattice reduction software and used in challenge records...
Quantum Lattice Enumeration and Tweaking Discrete Pruning
Lattices Quantum algorithms Enumeration
2018/6/5
Enumeration is a fundamental lattice algorithm used in challenge records. We show how to speed up enumeration on a quantum computer, which affects the security estimates of several lattice-based submi...
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
Enumeration Algorithms Short Vectors
2017/2/23
In 2003, Schnorr introduced Random sampling to find very short lattice vectors, as an alternative to enumeration. An improved variant has been used in the past few years by Kashiwabara et al. to solve...
This paper, examining the hardness of the search LWE problem, is a refined continuation of previous
works including (Lindner-Peikert 2011, Liu-Nguyen 2013, Aono et al. 2013) using lattice reduction a...