Publication:2757225
From MaRDI portal
zbMath0973.94514MaRDI QIDQ2757225
H. H. Hörner, Claus Peter Schnorr
Publication date: 25 November 2001
Related Items
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance, Low-density attack revisited, Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA, Shortest vector from lattice sieving: a few dimensions for free, Safer parameters for the Chor-Rivest cryptosystem, Lattice-based algorithms for number partitioning in the hard phase, New Definition of Density on Knapsack Cryptosystems, Improving convergence and practicality of slide-type reductions, Lattice-based cryptography: a survey, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Algorithms for the Shortest and Closest Lattice Vector Problems, Non-standard approaches to integer programming, Random Sampling Revisited: Lattice Enumeration with Discrete Pruning, Non-injective knapsack public-key cryptosystems, Cryptographic Functions from Worst-Case Complexity Assumptions, Predicting Lattice Reduction, New \(t\)-designs and large sets of \(t\)-designs, Search for combinatorial objects using lattice algorithms -- revisited, Solving the knapsack problem via \(\mathbb Z\)-transform, Revisiting orthogonal lattice attacks on approximate common divisor problems
