LWE from non-commutative group rings
From MaRDI portal
Publication:2068391
DOI10.1007/s10623-021-00973-6zbMath1481.94090arXiv1612.06670OpenAlexW2951015695MaRDI QIDQ2068391
Jincheng Zhuang, Qi Cheng, Jun Zhang
Publication date: 19 January 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.06670
Group rings (16S34) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Non-commutative ring learning with errors from cyclic algebras ⋮ Enhanced matrix power function for cryptographic primitive construction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- On the ideal shortest vector problem over random rational primes
- Algebraically structured LWE. Revisited
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Weak Instances of PLWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Provably Weak Instances of Ring-LWE
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Efficient Public Key Encryption Based on Ideal Lattices
- Principal ideal group rings
- Attacks on the Search RLWE Problem with Small Errors
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- On the security of the multivariate ring learning with errors problem
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: LWE from non-commutative group rings
