The following pages link to Floating-Point LLL Revisited (Q5385731):
Displaying 50 items.
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Certified lattice reduction (Q2008874) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA (Q2152160) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Cryptanalysis of RSA for a special case with \(d > e\) (Q2267091) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Higher-dimensional 3-adic CM construction (Q2475072) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- A New Partial Key Exposure Attack on Multi-power RSA (Q2947151) (← links)
- LNS with Co-Transformation Competes with Floating-Point (Q2985681) (← links)
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
- Attacking (EC)DSA Given Only an Implicit Hint (Q3455504) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Cryptanalysis of General Lu-Lee Type Systems (Q3600350) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- (Q4787201) (← links)
- Optimizing floating point operations in Scheme (Q4951520) (← links)
- FloatX (Q4960963) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Floating-Point LLL: Theoretical and Practical Aspects (Q5188541) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format (Q5302769) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) (Q5458537) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- A Vectorized, Cache Efficient LLL Implementation (Q5862555) (← links)
- Algorithmic Number Theory (Q5899254) (← links)
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
