scientific article; zbMATH DE number 1852142
From MaRDI portal
Publication:4787205
zbMATH Open1006.94531MaRDI QIDQ4787205FDOQ4787205
Authors: Phong Q. Nguyen, Jacques Stern 
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460146
Title of this publication is not available (Why is that?)
Recommendations
Cited In (53)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Digital Signature Scheme Based on CVP ∞
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Correcting noisy exponentiation black-boxes modulo a prime
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Generalized cryptanalysis of small CRT-exponent RSA
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Some mathematical mysteries in lattices
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- The geometry of lattice cryptography
- Probability method for cryptanalysis of general multivariate modular linear equation
- Economical convex coverings and applications
- Title not available (Why is that?)
- Small CRT-exponent RSA revisited
- Predicting Lattice Reduction
- Lattice reduction: a toolbox for the cryptoanalyst
- A semidefinite programming method for integer convex quadratic minimization
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems
- Lattice polly cracker cryptosystems
- Euclidean lattices: theory and applications
- Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Noisy polynomial interpolation modulo prime powers
- On the reduction of a random basis
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Noisy Chinese remaindering in the Lee norm
- A note on the concrete hardness of the shortest independent vector in lattices
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Sparse non-negative stencils for anisotropic diffusion
- Cryptographic functions from worst-case complexity assumptions
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Meta-heuristic approaches to solve shortest lattice vector problem
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Cryptanalysis of General Lu-Lee Type Systems
- Recovering zeros of polynomials modulo a prime
- Small CRT-Exponent RSA Revisited
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- A tool kit for partial key exposure attacks on RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
- Balanced integer solutions of linear equations
- Symplectic Lattice Reduction and NTRU
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Improvements in the analysis of Kannan's CVP algorithm
- Predicting nonlinear pseudorandom number generators
- Title not available (Why is that?)
- Computational aspects of lattices and their cryptographic applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787205)
