scientific article; zbMATH DE number 1346524

MaRDI QIDQ4266548zbMATH OpenFDO

Authors M. Euchner, Claus Peter Schnorr

Publication date 3 October 1999

Mathematics Subject Classification ID

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

Cited in

(28)

• Improved low-density subset sum algorithms
• New \(t\)-designs and large sets of \(t\)-designs
• Simultaneous reduction of a lattice basis and its reciprocal basis
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Second order statistical behavior of LLL and BKZ
• Random lattices, threshold phenomena and efficient reduction algorithms.
• On the success probability of solving unique SVP via BKZ
• Search for combinatorial objects using lattice algorithms -- revisited
• Gadget-based iNTRU lattice trapdoors
• Computing the character table of a finite group.
• Fast LLL-type lattice reduction
• scientific article; zbMATH DE number 1274882 (Why is no real title available?)
• Improved Rounding for Spline Coefficients and Knots
• Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
• Non-injective knapsack public-key cryptosystems
• All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks
• BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
• Approximate polynomial GCD over integers
• Key recovery attack on the partial Vandermonde knapsack problem
• Quantum lattice enumeration in limited depth
• A complete analysis of the BKZ lattice reduction algorithm
• Heuristic algorithm for solving restricted SVP and its applications
• Analyzing pump and jump BKZ algorithm using dynamical systems
• An effective branch-and-bound algorithm for convex quadratic integer programming
• An experimental comparison of some LLL-type lattice basis reduction algorithms
• DAWN: smaller and faster NTRU encryption via double encoding
• Equality tests in the polynomial modular number system
• \textsf{FrodoKEM}: a CCA-secure learning with errors key encapsulation mechanism

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4266548)