Analyzing blockwise lattice algorithms using dynamical systems
From MaRDI portal
(Redirected from Publication:5199206)
Recommendations
Cited in
(61)- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- Second order statistical behavior of LLL and BKZ
- Improving the BKZ reduction algorithm by quick reordering technique
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- Analysis of DeepBKZ reduction for finding short lattice vectors
- The convergence of slide-type reductions
- On the success probability of solving unique SVP via BKZ
- A polynomial-time algorithm for solving the hidden subset sum problem
- Fast reduction of algebraic lattices over cyclotomic fields
- 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
- A physical study of the LLL algorithm
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Towards faster polynomial-time lattice reduction
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Self-dual DeepBKZ for finding short lattice vectors
- On the complexity of the BKW algorithm on LWE
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- A new parallel lattice reduction algorithm for BKZ reduced bases
- Bounding basis reduction properties
- Improving convergence and practicality of slide-type reductions
- A lattice reduction algorithm based on sublattice BKZ
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A sieve algorithm based on overlattices
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- A practical post-quantum public-key cryptosystem based on spLWE
- BKZ 2.0: Better lattice security estimates
- PBKZ algorithm and its application in lattice challenge
- PotLLL: a polynomial time version of LLL with deep insertions
- scientific article; zbMATH DE number 1870221 (Why is no real title available?)
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Learning strikes again: the case of the DRS signature scheme
- Individual discrete logarithm with sublattice reduction
- EHNP strikes back: analyzing SM2 implementations
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
- On module unique-SVP and NTRU
- Dynamic Cantor Derivative Logic
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
- Concrete analysis of quantum lattice enumeration
- A refined hardness estimation of LWE in two-step mode
- An algebraic algorithm for breaking NTRU with multiple keys
- A complete analysis of the BKZ lattice reduction algorithm
- On the smallest ratio problem of lattice bases
- On the ability to approximate k-DSP of HKZ, BKZ and slide reduction
- Discrete Gaussian sampling for BKZ-reduced basis
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- Towards a modern LLL implementation
- Predicting module-lattice reduction
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- A new BKZ-type reduction with provable termination and development of its self-dual variant
- A lattice approach to analysis and synthesis problems
This page was built for publication: Analyzing blockwise lattice algorithms using dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199206)
