Lattice basis reduction: Improved practical algorithms and solving subset sum problems
From MaRDI portal
Recommendations
- Lattice Reduction Algorithms: Theory and Practice
- A hierarchy of polynomial time lattice basis reduction algorithms
- A more efficient algorithm for lattice basis reduction
- scientific article; zbMATH DE number 3958726
- scientific article; zbMATH DE number 3972987
- Practical, Predictable Lattice Basis Reduction
- Towards faster polynomial-time lattice reduction
- scientific article; zbMATH DE number 1643923
- Heuristics on lattice basis reduction in practice
Cites work
- scientific article; zbMATH DE number 4213909 (Why is no real title available?)
- scientific article; zbMATH DE number 4045845 (Why is no real title available?)
- scientific article; zbMATH DE number 4074814 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1346512 (Why is no real title available?)
- scientific article; zbMATH DE number 1346524 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- A more efficient algorithm for lattice basis reduction
- Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Integer Programming with a Fixed Number of Variables
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Minkowski's Convex Body Theorem and Integer Programming
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Solving low-density subset sum problems
- The Generalized Basis Reduction Algorithm
Cited in
(only showing first 100 items - show all)- A polynomial-time algorithm for solving the hidden subset sum problem
- Fast reduction of algebraic lattices over cyclotomic fields
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Lattice-based algorithms for number partitioning in the hard phase
- On the success probability of solving unique SVP via BKZ
- The convergence of slide-type reductions
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- An experimental study of Kannan's embedding technique for the search LWE problem
- Analysis of DeepBKZ reduction for finding short lattice vectors
- A practical algorithm for completing half-Hadamard matrices using LLL
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Efficient computation of multidimensional theta functions
- On post-processing in the quantum algorithm for computing short discrete logarithms
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- On the ideal shortest vector problem over random rational primes
- Predicting truncated multiple recursive generators with unknown parameters
- Rational isogenies from irrational endomorphisms
- A low data complexity attack on the GMR-2 cipher used in the satellite phones
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
- A physical study of the LLL algorithm
- Solving LWR via BDD Strategy: Modulus Switching Approach
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- An extension of Kannan's embedding for solving ring-based LWE problems
- Solving market split problems with heuristical lattice reduction
- A semidefinite programming method for integer convex quadratic minimization
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Improving convergence and practicality of slide-type reductions
- A trace map attack against special ring-LWE samples
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Bounding basis reduction properties
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Self-dual DeepBKZ for finding short lattice vectors
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- A tale of three signatures: practical attack of ECDSA with wNAF
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Mean value formulas on sublattices and flags of the random lattice
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Lattice-based cryptography: a survey
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Topics in computational algebraic number theory
- scientific article; zbMATH DE number 4074814 (Why is no real title available?)
- Computing theta functions with Julia
- Deterministic factoring with oracles
- Quantum security analysis of CSIDH
- Reduced complexity \(K\) -best sphere decoder design for MIMO systems
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Finding shortest lattice vectors in the presence of gaps
- A semantically secure public key cryptoscheme using bit-pair shadows
- Better key sizes (and attacks) for LWE-based encryption
- Sieve algorithms for the shortest vector problem are practical
- Quantum algorithms for variants of average-case lattice problems via filtering
- Evaluating the cache side channel attacks against ECDSA
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- MLAMBDA: a modified LAMBDA method for integer least-squares estimation
- Random sampling revisited: lattice enumeration with discrete pruning
- Differential fault attack on Montgomery ladder and in the presence of scalar randomization
- Subexponential class group and unit group computation in large degree number fields
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- Dual lattice attacks for closest vector problems (with preprocessing)
- SoK: how (not) to design and implement post-quantum cryptography
- Comment on: ``Sum of squares of uniform random variables by I. Weissman
- Lattice Reduction Algorithms: Theory and Practice
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
- PotLLL: a polynomial time version of LLL with deep insertions
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- On the ring-LWE and polynomial-LWE problems
- Shortest vector from lattice sieving: a few dimensions for free
- Quantum-walk speedup of backtracking algorithms
- Dynamic trading under integer constraints
- Algorithms for the shortest and closest lattice vector problems
- Lattice Reduction for Modular Knapsack
- Approximating the densest sublattice from Rankin's inequality
- A sieve algorithm based on overlattices
- Factoring polynomials and the knapsack problem
- Analysis of PSLQ, an integer relation finding algorithm
- Low-density attack revisited
- On the optimality of lattices for the Coppersmith technique
- Cryptographic functions from worst-case complexity assumptions
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- Advanced lattice sieving on GPUs, with tensor cores
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- A non-commutative cryptosystem based on quaternion algebras
- scientific article; zbMATH DE number 1256681 (Why is no real title available?)
- Rigorous and Efficient Short Lattice Vectors Enumeration
This page was built for publication: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340057)
