Revisiting the Gentry-Szydlo Algorithm
From MaRDI portal
Recommendations
- A generalization of Gosper's algorithm
- Szabos algorithm and applications
- The Schur-Cohn algorithm revisited
- scientific article; zbMATH DE number 1189326
- scientific article; zbMATH DE number 3912258
- Gauss' algorithm revisited
- scientific article; zbMATH DE number 647772
- Newman-Janis algorithm revisited
- A class of revised Broyden algorithms
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
Cited in
(17)- Algorithms for commutative algebras over the rational numbers
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Roots of unity in orders
- Lattices with symmetry
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Determining cyclicity of finite modules
- Testing isomorphism of lattices over CM-orders
- Deciding orthogonality in construction-A lattices
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Rank-2 module-LIP with special matrices
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
- A search to distinguish reduction for the isomorphism problem on direct sum lattices
- Dimension-reducing algorithms for quaternion ideal-SVP
This page was built for publication: Revisiting the Gentry-Szydlo Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874510)
