Reconstructing truncated integer variables satisfying linear congruences
SIAM Journal on Computing - Special issue on cryptography
Algorithmic algebraic number theory
Algorithmic algebraic number theory
Improved low-density subset sum algorithms
Computational Complexity
A course in computational algebraic number theory
A course in computational algebraic number theory
Handbook of combinatorics (vol. 1)
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97
SAC '98 Proceedings of the Selected Areas in Cryptography
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
New Results on Lattice Basis Reduction in Practice
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The knapsack hash function proposed at Crypto'89 can be broken
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the state-of-the-art method fails to reduce can be solved using our new technique.