Revisiting the Gentry-Szydlo Algorithm
From MaRDI portal
Publication:2874510
DOI10.1007/978-3-662-44371-2_16zbMath1343.94070OpenAlexW151157452MaRDI QIDQ2874510
Hendrik W. jun. Lenstra, Alice Silverberg
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_16
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (11)
Roots of unity in orders ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Lattices with symmetry ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Algorithms for commutative algebras over the rational numbers ⋮ Determining cyclicity of finite modules ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Deciding Orthogonality in Construction-A Lattices ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
This page was built for publication: Revisiting the Gentry-Szydlo Algorithm
