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):
Displaying 12 items.
- Computational problems of quadratic forms: complexity and cryptographic perspectives (Q2800008) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← 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)
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2 (Q6489782) (← links)
- A new formulation of the linear equivalence problem and shorter less signatures (Q6595929) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- Representations of group actions and their applications in cryptography (Q6615541) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
- M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition (Q6637576) (← links)
- Cryptanalysis of rank-2 module-LIP in totally real number fields (Q6637723) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
