Pages that link to "Item:Q2170105"
From MaRDI portal
The following pages link to On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105):
Displayed 6 items.
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Hull attacks on the lattice isomorphism problem (Q6091133) (← links)
- Hardness estimates of the code equivalence problem in the rank metric (Q6130620) (← links)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple (Q6133964) (← links)
- Fast Falcon signature generation and verification using ARMv8 NEON instructions (Q6186363) (← links)
- Compact lattice gadget and its applications to hash-and-sign signatures (Q6190144) (← links)