The following pages link to Algorithmic Number Theory (Q5899254):
Displaying 40 items.
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- The Beauty and the Beasts -- the hard cases in LLL reduction (Q1800827) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Storage efficient algorithm for Hermite normal form using LLL (Q2229458) (← links)
- A stochastic variant of the abelian sandpile model (Q2302674) (← links)
- A new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Cryptanalysis of General Lu-Lee Type Systems (Q3600350) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients (Q5034517) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications (Q6091132) (← links)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
- Improved Herrmann-May's attack with merging variables and lower LLL bound (Q6575047) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Rational approximations, multidimensional continued fractions, and lattice reduction (Q6611636) (← links)
- On the possibility of a backdoor in the Micali-Schnorr generator (Q6635756) (← links)
- On the SVP for low-dimensional circulant lattices (Q6645172) (← links)
