Pages that link to "Item:Q2118552"
From MaRDI portal
The following pages link to Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\) (Q2118552):
Displaying 5 items.
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2 (Q6489782) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- Deciding whether a lattice has an orthonormal basis is in co-NP (Q6634539) (← links)
