Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
From MaRDI portal
Publication:2820508
DOI10.1007/978-3-662-49890-3_30zbMath1385.94007OpenAlexW2489545452MaRDI QIDQ2820508
Yun-Tao Wang, Tsuyoshi Takagi, Yoshinori Aono, Takuya Hayashi
Publication date: 9 September 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_30
Related Items (26)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Finding short integer solutions when the modulus is small ⋮ Improving convergence and practicality of slide-type reductions ⋮ Lattice-based public key cryptosystems invoking linear mapping mask ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Second order statistical behavior of LLL and BKZ ⋮ Vulnerable public keys in NTRU cryptosystem ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ The convergence of slide-type reductions ⋮ On the success probability of solving unique SVP via BKZ ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) ⋮ Improved lattice enumeration algorithms by primal and dual reordering methods ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
This page was built for publication: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
