Middle-products of skew polynomials and learning with errors
From MaRDI portal
Recommendations
Cites work
- A probabilistic algorithm for verifying polynomial middle product in linear time
- Algebraically structured LWE. Revisited
- Concise Encyclopedia of Coding Theory
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast Multiplication for Skew Polynomials
- Generalized Gabidulin codes over fields of any characteristic
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 3037565 (Why is no real title available?)
- Lattice trapdoors and IBE from middle-product LWE
- Middle-product Learning with Errors
- Middle-product learning with rounding problem and its applications
- MPSign: a signature from small-secret middle-product learning with errors
- Non-commutative ring learning with errors from cyclic algebras
- NTRU in Quaternion Algebras of Bounded Discriminant
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the ring-LWE and polynomial-LWE problems
- On the RLWE/PLWE equivalence for cyclotomic number fields
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- The middle product algorithm. I: Speeding up the division and square root of power series
- Theory of non-commutative polynomials
Cited in
(2)
This page was built for publication: Middle-products of skew polynomials and learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595945)