A trace map attack against special ring-LWE samples
From MaRDI portal
Publication:2128748
Recommendations
- Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack
- Provably weak instances of ring-LWE revisited
- Provably weak instances of Ring-LWE
- (In)security of ring-LWE under partial key exposure
- Attacks on Integer-RLWE
- Single-trace side-channel attacks on masked lattice-based encryption
- Ring-LWE: applications to cryptography and their efficient realization
- A toolkit for ring-LWE cryptography
- Key Bit-Dependent Attack on Protected PKC Using a Single Trace
- Practical analysis of key recovery attack against search-LWE problem
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A refined analysis of the cost for solving LWE via uSVP
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Algebraically structured LWE. Revisited
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- BKZ 2.0: Better lattice security estimates
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Factoring polynomials with rational coefficients
- Hermite’s Constant and Lattice Algorithms
- How (not) to instantiate ring-LWE
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- Large modulus ring-LWE \(\geq \) module-LWE
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice-based Cryptography
- Minkowski's Convex Body Theorem and Integer Programming
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the efficacy of solving LWE by reduction to unique-SVP
- On the hardness of module-LWE with binary secret
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Predicting Lattice Reduction
- Revisiting the expected cost of solving uSVP and applications to LWE
- Second order statistical behavior of LLL and BKZ
- Worst-case to average-case reductions for module lattices
Cited in
(2)
This page was built for publication: A trace map attack against special ring-LWE samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128748)