Learning with errors over group rings constructed by semi-direct product

DOI10.1007/S10623-026-01809-XMaRDI QIDQ6844125zbMATH OpenFDO

Authors Fangwei Fu, Jiaqi Liu

Publication date 16 March 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01809-X

zbMATH Keywords

computational hardnessgroup representationsgroup ringslattice-based cryptographylearning with errorssemi-direct product

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Group rings (16S34) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Framework for Efficient and Composable Oblivious Transfer
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algebraically structured LWE. Revisited
• Attacks on the Search RLWE Problem with Small Errors
• Attribute-based encryption for circuits
• Bonsai trees, or how to delegate a lattice basis
• Candidate Multilinear Maps from Ideal Lattices
• Efficient fully homomorphic encryption from (standard) LWE
• Efficient lattice (H)IBE in the standard model
• Efficient public key encryption based on ideal lattices (extended abstract)
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Factoring polynomials with rational coefficients
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fully homomorphic encryption using ideal lattices
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Functional encryption for inner product predicates from learning with errors
• Graph-induced multilinear maps from lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Key homomorphic PRFs and their applications
• Large modulus ring-LWE \(\geq \) module-LWE
• LWE from non-commutative group rings
• Middle-product Learning with Errors
• New and improved key-homomorphic pseudorandom functions
• New bounds in some transference theorems in the geometry of numbers
• New directions in cryptography
• Non-commutative ring learning with errors from cyclic algebras
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On Lovász' lattice reduction and the nearest lattice point problem
• On the ideal shortest vector problem over random rational primes
• On the ring-LWE and polynomial-LWE problems
• Order-LWE and the hardness of ring-LWE with entropic secrets
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Predicate encryption for circuits from LWE
• Provably weak instances of Ring-LWE
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Recovering short generators of principal ideals in cyclotomic rings
• Short Stickelberger class relations and application to Ideal-SVP
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst-case to average-case reductions for module lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

This page was built for publication: Learning with errors over group rings constructed by semi-direct product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844125)