Learning with errors from nonassociative algebras
From MaRDI portal
Cites work
- A toolkit for ring-LWE cryptography
- Concise Encyclopedia of Coding Theory
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast Multiplication for Skew Polynomials
- Fast operations on linearized polynomials and their applications in coding theory
- Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
- Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
- Full-diversity, high-rate space-time block codes from division algebras
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How a nonassociative algebra reflects the properties of a skew polynomial
- How to obtain lattices from (f,,)-codes via a generalization of construction A
- scientific article; zbMATH DE number 4047907 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Maximal orders in nonassociative quaternion algebras
- Maximal Orders in the Design of Dense Space-Time Lattice Codes
- Middle-products of skew polynomials and learning with errors
- Non-commutative ring learning with errors from cyclic algebras
- Nonassociative 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 concrete hardness of learning with errors
- On the security of the multivariate ring learning with errors problem
- Quotients of orders in algebras obtained from skew polynomials with applications to coding theory
- Quotients of orders in cyclic algebras and space-time codes
- Simple graded rings, nonassociative crossed products and Cayley-Dickson doublings
- Space-time block codes from nonassociative division algebras
- Structure of algebras.
- TFHE: fast fully homomorphic encryption over the torus
- Theory of non-commutative polynomials
- Worst-case to average-case reductions based on Gaussian measures
- Worst-case to average-case reductions for module lattices
This page was built for publication: Learning with errors from nonassociative algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326425)
