CryptoDB
Learning with Errors from Nonassociative Algebras
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | We construct a provably-secure structured variant of Learning with Errors (LWE) using nonassociative cyclic division algebras, assuming the hardness of worst-case structured lattice problems, for which we are able to give a full search-to-decision reduction, improving upon the construction of Grover et al. named `Cyclic Learning with Errors' (CLWE). We are thus able to create structured LWE over cyclic algebras without any restriction on the size of secret spaces, which was required for CLWE as a result of its restricted security proof. We reduce the shortest independent vectors problem in ideal lattices, obtained from ideals in orders of such algebras, to the decision variant of LWE defined for nonassociative CDAs. We believe this variant has greater security and greater freedom with parameter choices than CLWE, and greater asymptotic efficiency of multiplication than module LWE. Our reduction requires new results in the ideal theory of such nonassociative algebras, which may be of independent interest. We then adapt an LPR-like PKE scheme to hold for nonassociative spaces, and discuss the efficiency and security of our construction, showing that it is immune to certain subfield attacks. Finally, we give example parameters to construct algebras for cryptographic use. |
BibTeX
@article{cic-2025-34909,
title={Learning with Errors from Nonassociative Algebras},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 4},
url={https://cic.iacr.org/p/1/4/16},
doi={10.62056/aee0wa3y6},
author={Andrew Mendelsohn and Cong Ling},
year=2025
}