Pages that link to "Item:Q1999896"
From MaRDI portal
The following pages link to Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896):
Displaying 4 items.
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
- (Q4598216) (← links)
- Construction-D lattice from Garcia–Stichtenoth tower code (Q6499093) (← links)