scientific article; zbMATH DE number 1346524

zbMath0925.11049MaRDI QIDQ4266548

M. Euchner, Claus Peter Schnorr

Publication date: 3 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Number-theoretic algorithms; complexity (11Y16)

Related Items

Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Gadget-based iNTRU lattice trapdoors, All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks, Approximate polynomial GCD over integers, Computing the character table of a finite group., Unnamed Item, Second order statistical behavior of LLL and BKZ, Improved low-density subset sum algorithms, Improved Rounding for Spline Coefficients and Knots, Fast LLL-type lattice reduction, Non-injective knapsack public-key cryptosystems, An effective branch-and-bound algorithm for convex quadratic integer programming, An experimental comparison of some LLL-type lattice basis reduction algorithms, On the success probability of solving unique SVP via BKZ, New \(t\)-designs and large sets of \(t\)-designs, Random lattices, threshold phenomena and efficient reduction algorithms., Simultaneous reduction of a lattice basis and its reciprocal basis, Search for combinatorial objects using lattice algorithms -- revisited