fpLLL

swMATH13489MaRDI QIDQ25403FDOQ25403

Author name not available (Why is that?)

Source code repository: https://github.com/dstehle/fplll

Cited In (47)

• On the security of OSIDH
• Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
• Rigorous and Efficient Short Lattice Vectors Enumeration
• An extension of Kannan's embedding for solving ring-based LWE problems
• Improving convergence and practicality of slide-type reductions
• Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
• Analysis of DeepBKZ reduction for finding short lattice vectors
• Just a Little Bit More
• Self-dual DeepBKZ for finding short lattice vectors
• Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
• Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
• LWE with side information: attacks and concrete security estimation
• Computing genus 1 Jacobi forms
• Algorithms for the shortest and closest lattice vector problems
• Algorithms for CRT-variant of approximate greatest common divisor problem
• The general sieve kernel and new records in lattice reduction
• Lattice-packing by spheres and eutactic forms
• Application of mixed integer quadratic program to shortest vector problems
• A formalization of the LLL basis reduction algorithm
• Handbook of floating-point arithmetic
• Lattice Reduction for Modular Knapsack
• A tale of three signatures: practical attack of ECDSA with wNAF
• Six-loop anomalous dimension of twist-two operators in planar \( \mathcal{N}=4 \) SYM theory
• Lower bounds on lattice enumeration with extreme pruning
• Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
• Computations of the Mertens function and improved bounds on the Mertens conjecture
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
• Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions
• Cryptanalysis of a homomorphic encryption scheme over integers
• Arithmetic software libraries
• (In)security of ring-LWE under partial key exposure
• Bounding basis reduction properties
• Solving thousand-digit Frobenius problems using Gröbner bases
• Analysis of Gauss-sieve for solving the shortest vector problem in lattices
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
• Sieve, Enumerate, Slice, and Lift:
• Solving the search-LWE problem over projected lattices
• A lattice reduction algorithm based on sublattice BKZ
• The irreducible vectors of a lattice: some theory and applications
• An improved method for predicting truncated multiple recursive generators with unknown parameters
• Exact result in \(\mathcal{N} = 4\) SYM theory: generalised double-logarithmic equation
• A polynomial-time algorithm for solving the hidden subset sum problem
• Fast reduction of algebraic lattices over cyclotomic fields
• A verified efficient implementation of the LLL basis reduction algorithm

This page was built for software: fpLLL