scientific article; zbMATH DE number 1962809
From MaRDI portal
Publication:4418644
zbMath1035.68113MaRDI QIDQ4418644
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070145.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Approximation algorithms (68W25)
Related Items (38)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Lattice Point Enumeration on Block Reduced Bases ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ On the asymptotic complexity of solving LWE ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Finding short integer solutions when the modulus is small ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Second order statistical behavior of LLL and BKZ ⋮ NTRU prime: reducing attack surface at low cost ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Fast LLL-type lattice reduction ⋮ BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices ⋮ New NTRU Records with Improved Lattice Bases ⋮ Concrete analysis of quantum lattice enumeration ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Provable dual attacks on learning with errors ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ On the success probability of solving unique SVP via BKZ ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) ⋮ Improved lattice enumeration algorithms by primal and dual reordering methods ⋮ A physical study of the LLL algorithm ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
This page was built for publication:
