scientific article; zbMATH DE number 1852142
From MaRDI portal
Recommendations
Cited in
(53)- Improvements in the analysis of Kannan's CVP algorithm
- scientific article; zbMATH DE number 1643920 (Why is no real title available?)
- Computational aspects of lattices and their cryptographic applications
- scientific article; zbMATH DE number 2063208 (Why is no real title available?)
- scientific article; zbMATH DE number 2156419 (Why is no real title available?)
- scientific article; zbMATH DE number 2085214 (Why is no real title available?)
- Correcting noisy exponentiation black-boxes modulo a prime
- A Digital Signature Scheme Based on CVP ∞
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Generalized cryptanalysis of small CRT-exponent RSA
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Probability method for cryptanalysis of general multivariate modular linear equation
- Some mathematical mysteries in lattices
- The geometry of lattice cryptography
- Economical convex coverings and applications
- Small CRT-exponent RSA revisited
- scientific article; zbMATH DE number 7561389 (Why is no real title available?)
- Lattice reduction: a toolbox for the cryptoanalyst
- Predicting Lattice Reduction
- Lattice polly cracker cryptosystems
- A semidefinite programming method for integer convex quadratic minimization
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems
- 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
- Noisy Chinese remaindering in the Lee norm
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- A note on the concrete hardness of the shortest independent vector in lattices
- Sparse non-negative stencils for anisotropic diffusion
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Cryptographic functions from worst-case complexity assumptions
- 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
- Recovering zeros of polynomials modulo a prime
- Cryptanalysis of General Lu-Lee Type Systems
- 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
- Balanced integer solutions of linear equations
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Symplectic Lattice Reduction and NTRU
- Predicting nonlinear pseudorandom number generators
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)
