Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7774569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice |
scientific article; zbMATH DE number 7774569 |
Statements
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (English)
0 references
8 December 2023
0 references
public-key encryption scheme
0 references
bases for rotations of \(\mathbb{Z}^n\)
0 references
0 references
0 references
0 references
0 references
0 references
0.8795624
0 references
0.8071089
0 references
0.8030555
0 references
0.80020213
0 references
