Pages that link to "Item:Q6083665"

The following pages link to Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665):

Displaying 3 items.

• 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)
• Cryptanalysis of rank-2 module-LIP in totally real number fields (Q6637723) (← links)