Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
From MaRDI portal
Publication:6548441
DOI10.3934/amc.2023043zbMath1539.11141MaRDI QIDQ6548441
Publication date: 1 June 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Cryptography (94A60) Cyclotomic extensions (11R18) Other algebras and orders, and their zeta and (L)-functions (11R54) Lattices over orders (16H20)
Cites Work
- Unnamed Item
- Unnamed Item
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
- Natural orders for asymmetric space-time coding: minimizing the discriminant
- Number fields with prescribed norms (with an appendix by Yonatan Harpaz and Olivier Wittenberg)
- Non-commutative ring learning with errors from cyclic algebras
- Order-LWE and the hardness of ring-LWE with entropic secrets
- Worst-case to average-case reductions for module lattices
- Structure of algebras.
- STBC-Schemes With Nonvanishing Determinant for Certain Number of Transmit Antennas
- Full-diversity, high-rate space-time block codes from division algebras
- Perfect Space–Time Codes for Any Number of Antennas
- On Ideal Lattices and Learning with Errors over Rings
- Maximal Orders in the Design of Dense Space-Time Lattice Codes
- Efficient Public Key Encryption Based on Ideal Lattices
- On the Densest MIMO Lattices From Cyclic Division Algebras
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Number fields
This page was built for publication: Fractional non-norm elements for division algebras, and an application to cyclic learning with errors