scientific article; zbMATH DE number 1962809

From MaRDI portal
Publication:4418644

zbMath1035.68113MaRDI QIDQ4418644

Claus Peter Schnorr

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.



Related Items (34)

Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performanceSieve, Enumerate, Slice, and Lift:Solving the search-LWE problem over projected latticesAn extension of Kannan's embedding for solving ring-based LWE problems\(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryptionLattice Point Enumeration on Block Reduced BasesFinding shortest lattice vectors faster using quantum searchGeneralized attack on ECDSA: known bits in arbitrary positionsOn the asymptotic complexity of solving LWEOn the measurement and simulation of the BKZ behavior for \(q\)-ary latticesDevelopment and analysis of massive parallelization of a lattice basis reduction algorithmFinding short integer solutions when the modulus is smallA lattice reduction algorithm based on sublattice BKZExplicit Hard Instances of the Shortest Vector ProblemA Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$An Experimental Study of Kannan’s Embedding Technique for the Search LWE ProblemDynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementationSecond order statistical behavior of LLL and BKZNTRU prime: reducing attack surface at low costAnalysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectorsAnalysis of DeepBKZ reduction for finding short lattice vectorsRevisiting Lattice Attacks on Overstretched NTRU ParametersRandom Sampling Revisited: Lattice Enumeration with Discrete PruningOn Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEALFast LLL-type lattice reductionBetter Key Sizes (and Attacks) for LWE-Based EncryptionA Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP ChallengeOn the success probability of solving unique SVP via BKZA new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengthsPractical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiencyFaster 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 methodsA physical study of the LLL algorithmRevisiting orthogonal lattice attacks on approximate common divisor problems




This page was built for publication: