Pages that link to "Item:Q1744870"
From MaRDI portal
The following pages link to Lattice reductions over Euclidean rings with applications to cryptanalysis (Q1744870):
Displaying 10 items.
- A generalization of the LLL-algorithm over Euclidean rings or orders (Q679101) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices (Q2875699) (← links)
- Lattices Over Eisenstein Integers for Compute-and-Forward (Q2977212) (← links)
- (Q4364546) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Unit reducible fields and perfect unary forms (Q6121264) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
