On the ring-LWE and polynomial-LWE problems
From MaRDI portal
Publication:1648786
DOI10.1007/978-3-319-78381-9_6zbMATH Open1421.94069OpenAlexW2795036470MaRDI QIDQ1648786FDOQ1648786
Authors: Miruna Rosca, Damien Stehlé, Alexandre Wallet 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_6
Recommendations
Cites Work
- Ring switching in BGV-style homomorphic encryption
- Title not available (Why is that?)
- New hash functions and their use in authentication and set equality
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient public key encryption based on ideal lattices (extended abstract)
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Classical hardness of learning with errors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Title not available (Why is that?)
- One Way Hash Functions and DES
- Making NTRU as secure as worst-case problems over ideal lattices
- Finding Collisions in the Full SHA-1
- Worst-case to average-case reductions for module lattices
- On ideal lattices and learning with errors over rings
- Theory of Cryptography
- A composition theorem for universal one-way hash functions
- Efficiently decodable compressed sensing by list-recoverable codes and recursion
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- A toolkit for ring-LWE cryptography
- The first collision for full SHA-1
- Large modulus ring-LWE \(\geq \) module-LWE
- How (not) to instantiate ring-LWE
- Public Key Cryptography - PKC 2006
- Pseudorandomness of ring-LWE for any ring and modulus
- Recovering short generators of principal ideals in cyclotomic rings
- Middle-product Learning with Errors
- Weak instances of PLWE
- Provably weak instances of ring-LWE revisited
- Ring-LWE in polynomial rings
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- On error distributions in ring-based LWE
- Provably weak instances of Ring-LWE
- Title not available (Why is that?)
- Attacks on the Search RLWE Problem with Small Errors
- Explicit, almost optimal, epsilon-balanced codes
- Short generators without quantum computers: the case of multiquadratics
- Short Stickelberger class relations and application to Ideal-SVP
Cited In (39)
- On the hardness of module-LWE with binary secret
- Provably secure NTRUEncrypt over any cyclotomic field
- Ring-LWE: applications to cryptography and their efficient realization
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Algebraic lattices via polynomial rings
- Ring-LWE cryptography for the number theorist
- RLWE/PLWE equivalence for the maximal totally real subextension of the \(2^rpq\)-th cyclotomic field
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Euclidean lattices: theory and applications
- RLWE and PLWE over cyclotomic fields are not equivalent
- Algebraically structured LWE. Revisited
- Trace-based cryptanalysis of cyclotomic \(R_{q, 0} \times R_q\)-PLWE for the non-split case
- Algebraically structured LWE, revisited
- Middle-products of skew polynomials and learning with errors
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Large modulus ring-LWE \(\geq \) module-LWE
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Towards a ring analogue of the leftover hash lemma
- Towards classical hardness of module-LWE: the linear rank case
- On the condition number of the Vandermonde matrix of the \(n\)th cyclotomic polynomial
- Ring-LWE in polynomial rings
- Provably weak instances of Ring-LWE
- Weak instances of PLWE
- Provably weak instances of ring-LWE revisited
- On the RLWE/PLWE equivalence for cyclotomic number fields
- MPSign: a signature from small-secret middle-product learning with errors
- Hardness of (M)LWE with semi-uniform seeds
- On algebraic embedding for unstructured lattices
- TFHE public-key encryption revisited
- RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices
- On the hardness of module learning with errors with short distributions
- On the integer polynomial learning with errors problem
- Hardness of entropic module-LWE
- On codes and learning with errors over function fields
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- On the hardness of the NTRU problem
- Adaptively secure identity-based encryption from middle-product learning with errors
- Pseudorandomness of ring-LWE for any ring and modulus
- Rounding in the rings
This page was built for publication: On the ring-LWE and polynomial-LWE problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648786)
