Lattice basis reduction: Improved practical algorithms and solving subset sum problems

1994/08/01 by C. P. Schnorr, M. Euchner · 21 citations
Computer Science · #Machine Learning and Algorithms #Cryptography and Data Security #Complexity and Algorithms in Graphs

paper · doi:10.1007/bf01581144

Cited by

• Probabilistic Analysis of LLL Reduced Bases
• Design and Evaluation of Alternate Enumeration Techniques for Subset Sum Problem
• Obtuse Lattice Bases
• Closed-Form Word Error Rate Analysis for Successive Interference Cancellation Decoders
• A Polynomial Time Version of LLL With Deep Insertions
• Lattice Reduction over Imaginary Quadratic Fields
• A new Hybrid Lattice Attack on Galbraith's Binary LWE Cryptosystem
• Effects of the LLL reduction on the success probability of the Babai point and on the complexity of sphere decoding
• A New Family of Low-Complexity STBCs for Four Transmit Antennas
• Mean value formulas on sublattices and flags of the random lattice
• Dynamic trading under integer constraints
• Techniques in Lattice Basis Reduction
• On Fast-Decodable Space-Time Block Codes
• Large Multiuser MIMO Detection: Algorithms and Architectures
• Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices
• A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
• Parameter security characterization of knapsack public-key crypto under quantum computing
• Efficient decoding algorithm using triangularity of \mbfR matrix of QR-decomposition
• Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder
• Success probability of the Babai estimators for box-constrained integer linear models
• MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation