Floating-Point LLL Revisited
From MaRDI portal
Publication:5385731
DOI10.1007/11426639_13zbMath1137.94353OpenAlexW1532770887MaRDI QIDQ5385731
Phong Q. Nguyen, Damien Stehlé
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_13
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Nonconvex bodies (11H16)
Related Items (44)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction ⋮ Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization ⋮ Attacking (EC)DSA Given Only an Implicit Hint ⋮ Lattice Reduction for Modular Knapsack ⋮ An efficient lattice reduction using reuse technique blockwisely on NTRU ⋮ Probability method for cryptanalysis of general multivariate modular linear equation ⋮ Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format ⋮ Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA ⋮ Segment LLL reduction of lattice bases using modular arithmetic ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ PotLLL: a polynomial time version of LLL with deep insertions ⋮ Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ Computational Number Theory, Past, Present, and Future ⋮ A public key cryptosystem based on three new provable problems ⋮ Gradual sub-lattice reduction and a new complexity for factoring polynomials ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ Thrackles: An Improved Upper Bound ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Higher-dimensional 3-adic CM construction ⋮ List decoding of number field codes ⋮ Fast LLL-type lattice reduction ⋮ Cryptanalysis of RSA for a special case with \(d > e\) ⋮ Symplectic Lattice Reduction and NTRU ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Cryptanalysis of General Lu-Lee Type Systems ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms ⋮ 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 ∞ ⋮ Identification and signatures based on NP-hard problems of indefinite quadratic forms ⋮ Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) ⋮ Predicting Lattice Reduction ⋮ Factoring polynomials over global fields ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ A Vectorized, Cache Efficient LLL Implementation
This page was built for publication: Floating-Point LLL Revisited
