The following pages link to (Q4787205):
Displayed 42 items.
- Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound (Q1727391) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Small CRT-exponent RSA revisited (Q2010590) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents (Q2202020) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- Sparse non-negative stencils for anisotropic diffusion (Q2251259) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Generalized cryptanalysis of small CRT-exponent RSA (Q2330126) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs (Q2817816) (← links)
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- A Tool Kit for Partial Key Exposure Attacks on RSA (Q2975796) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Cryptanalysis of General Lu-Lee Type Systems (Q3600350) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- (Q4615809) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation (Q4806399) (← links)
- Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
- (Q5091027) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← 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)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
- Small CRT-Exponent RSA Revisited (Q5738972) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- On the reduction of a random basis (Q5851031) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)