Floating-Point LLL Revisited
From MaRDI portal
Recommendations
- Floating-Point LLL: Theoretical and Practical Aspects
- Adaptive precision floating point LLL
- Exploiting structure in floating-point arithmetic
- scientific article; zbMATH DE number 1852138
- Fast floating-point processing in Common Lisp
- Floating-point arithmetic in the Coq system
- Remark on “Fast floating-point processing in Common Lisp”
- Optimizing floating point operations in Scheme
Cited in
(60)- Factoring polynomials over global fields
- Segment LLL reduction of lattice bases using modular arithmetic
- Certified lattice reduction
- Fast reduction of algebraic lattices over cyclotomic fields
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Towards faster polynomial-time lattice reduction
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- List decoding of number field codes
- Cryptanalysis of RSA for a special case with \(d > e\)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Higher-dimensional 3-adic CM construction
- Fast LLL-type lattice reduction
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- A new partial key exposure attack on multi-power RSA
- LNS with Co-Transformation Competes with Floating-Point
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Attacking RSA with a composed decryption exponent using unravelled linearization
- Attacking (EC)DSA given only an implicit hint
- Lattice Reduction for Modular Knapsack
- Explicit Hard Instances of the Shortest Vector Problem
- An LLL algorithm with quadratic complexity
- Symplectic Lattice Reduction and NTRU
- Cryptanalysis of General Lu-Lee Type Systems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Identification and signatures based on NP-hard problems of indefinite quadratic forms
- PotLLL: a polynomial time version of LLL with deep insertions
- A public key cryptosystem based on three new provable problems
- Thrackles: an improved upper bound
- scientific article; zbMATH DE number 1852138 (Why is no real title available?)
- Optimizing floating point operations in Scheme
- FloatX
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
- Floating-Point LLL: Theoretical and Practical Aspects
- LLL: a tool for effective Diophantine approximation
- Using LLL-reduction for solving RSA and factorization problems
- Cryptographic functions from worst-case complexity assumptions
- Adaptive precision floating point LLL
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- A Digital Signature Scheme Based on CVP ∞
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Predicting Lattice Reduction
- A Vectorized, Cache Efficient LLL Implementation
- Algorithmic Number Theory
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight
- Algebraic number fields and the LLL algorithm
- Practical attacks on small private exponent RSA: new records and new insights
- Modular Las Vegas algorithms for polynomial absolute factorization
- Computational Number Theory, Past, Present, and Future
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- More on G-flux and general Hodge cycles on the Fermat sextic
- Concrete analysis of quantum lattice enumeration
- Fault attacks on multi-prime RSA signatures
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- A New Upper Bound on the Smallest Counterexample to the Mertens Conjecture
- Implicit factorization with shared any bits
- Probability method for cryptanalysis of general multivariate modular linear equation
This page was built for publication: Floating-Point LLL Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385731)
