Analysis of decreasing squared-sum of Gram–Schmidt lengths for short lattice vectors
In 2015, Fukase and Kashiwabara proposed an efficient method to find a very short lattice vector. Their method has been applied to solve Darmstadt shortest vector problems of dimensions 134 to 150. Their method is based on Schnorr’s random sampling, but their preprocessing is different from others....
Main Authors: | Yasuda Masaya, Yokoyama Kazuhiro, Shimoyama Takeshi, Kogure Jun, Koshiba Takeshi |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-03-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2016-0008 |
Similar Items
-
Self-dual DeepBKZ for finding short lattice vectors
by: Yasuda Masaya
Published: (2020-06-01) -
On the exact decryption range for Gentry–Halevi's implementation of fully homomorphic encryption
by: Yasuda Masaya, et al.
Published: (2014-09-01) -
On Two Alternative Axiomatizations of Lattices by McKenzie and Sholander
by: Grabowski Adam, et al.
Published: (2018-07-01) -
Efficient MIMO Preprocessor With Sorting-Relaxed QR Decomposition and Modified Greedy LLL Algorithm
by: Lirui Chen, et al.
Published: (2020-01-01) -
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography
by: Hami Satılmış, et al.
Published: (2021-07-01)