Lattices with symmetry

DOI10.1007/s00145-016-9235-7zbMath1377.94060arXiv1501.00178OpenAlexW2570157913MaRDI QIDQ2408587

Alice Silverberg, Hendrik W. jun. Lenstra

Publication date: 12 October 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00178

zbMATH Keywords

ideal latticeslatticeslattice-based cryptographyGentry-Szydlo algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (6)

Universal gradings of orders ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ Deciding Orthogonality in Construction-A Lattices ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)

Cites Work

• Determining cyclicity of finite modules
• Factoring polynomials with rational coefficients
• Roots of unity in orders
• Revisiting the Gentry-Szydlo Algorithm
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• Intégration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lattices with symmetry