scientific article; zbMATH DE number 1852142
From MaRDI portal
Publication:4787205
zbMath1006.94531MaRDI QIDQ4787205
Jacques Stern, Phong Q. Nguyen
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460146
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Meta-heuristic approaches to solve shortest lattice vector problem ⋮ Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction ⋮ Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation ⋮ Probability method for cryptanalysis of general multivariate modular linear equation ⋮ Recovering zeros of polynomials modulo a prime ⋮ Balanced Integer Solutions of Linear Equations ⋮ A note on the concrete hardness of the shortest independent vector in lattices ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Correcting noisy exponentiation black-boxes modulo a prime ⋮ Lattice polly cracker cryptosystems ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ The projection games conjecture and the hardness of approximation of Super-SAT and related problems ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ Sparse non-negative stencils for anisotropic diffusion ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Predicting nonlinear pseudorandom number generators ⋮ Symplectic Lattice Reduction and NTRU ⋮ Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Cryptanalysis of General Lu-Lee Type Systems ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ Unnamed Item ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ Noisy polynomial interpolation modulo prime powers ⋮ Improvements in the analysis of Kannan's CVP algorithm ⋮ Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) ⋮ Predicting Lattice Reduction ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ On the reduction of a random basis ⋮ Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms ⋮ Noisy Chinese remaindering in the Lee norm ⋮ Unnamed Item ⋮ Generalized cryptanalysis of small CRT-exponent RSA ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation
This page was built for publication:
