fpLLL
From MaRDI portal
Software:25403
swMATH13489MaRDI QIDQ25403FDOQ25403
Author name not available (Why is that?)
Source code repository: https://github.com/dstehle/fplll
Cited In (47)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF
- 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 Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
- 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
- LWE with side information: attacks and concrete security estimation
- Computing genus 1 Jacobi forms
- Arithmetic Software Libraries
- Algorithms for CRT-variant of approximate greatest common divisor problem
- Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
- The general sieve kernel and new records in lattice reduction
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Application of mixed integer quadratic program to shortest vector problems
- A formalization of the LLL basis reduction algorithm
- Lattice Reduction for Modular Knapsack
- 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 the Security of OSIDH
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Algorithms for the Shortest and Closest Lattice Vector Problems
- Computations of the Mertens function and improved bounds on the Mertens conjecture
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- A Verified Efficient Implementation of the LLL Basis Reduction Algorithm
- (In)security of ring-LWE under partial key exposure
- Bounding basis reduction properties
- Handbook of Floating-Point Arithmetic
- Solving thousand-digit Frobenius problems using Gröbner bases
- 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
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers
- 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
- Lattice-Packing by Spheres and Eutactic Forms
- Computing Generator in Cyclotomic Integer Rings
This page was built for software: fpLLL