Fast reduction of algebraic lattices over cyclotomic fields
type: Item
instance of: scholarly article
title: Fast reduction of algebraic lattices over cyclotomic fields
zbMATH Open document ID: 1504.94161
DOI: 10.1007/978-3-030-56880-1_6
author: Paul Kirchner
author: Thomas Espitau
author: Pierre-Alain Fouque
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614566
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: Gentry-Szydlo algorithm
describes a project that uses: fpLLL
describes a project that uses: mctoolbox
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 6
OpenAlex ID: W3048502882
cites work: Q4228459
cites work: A Subfield Lattice Attack on Overstretched NTRU Assumptions
cites work: Implementing Candidate Graded Encoding Schemes from Ideal Lattices
cites work: Computing Generator in Cyclotomic Integer Rings
cites work: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities
cites work: Recovering Short Generators of Principal Ideals in Cyclotomic Rings
cites work: Symplectic Lattice Reduction and NTRU
cites work: Q3549702
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: Q4737253
cites work: Q5689624
cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
cites work: Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Cryptanalysis of GGH Map
cites work: Lattice reductions over Euclidean rings with applications to cryptanalysis
cites work: Revisiting Lattice Attacks on Overstretched NTRU Parameters
cites work: Worst-case to average-case reductions for module lattices
cites work: An LLL algorithm for module lattices
cites work: Factoring polynomials with rational coefficients
cites work: Testing Isomorphism of Lattices over CM-Orders
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Algorithms and Data Structures
cites work: Practical, Predictable Lattice Basis Reduction
cites work: A generalization of the LLL-algorithm over Euclidean rings or orders
cites work: Q3795753
cites work: Faster LLL-type Reduction of Lattice Bases
cites work: Floating-Point LLL Revisited
cites work: An LLL-reduction algorithm with quasi-linear time complexity
cites work: More efficient algorithms for the NTRU key generation using the field norm
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Computing the Iwasawa decomposition of the classical Lie groups of noncompact type using the \(QR\) decomposition
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Q4237380
cites work: Simultaneous reduction of a lattice basis and its reciprocal basis
cites work: Q4234250
Recommended article: Q4227322
Recommended article: Lattice Reduction Over Imaginary Quadratic Fields
Recommended article: On the Reducibility of Cyclotomic Polynomials over Finite Fields
Recommended article: Towards faster polynomial-time lattice reduction
Recommended article: Fast arithmetic for the algebraic closure of finite fields
Recommended article: Q3840198
Recommended article: Faster LLL-type Reduction of Lattice Bases
Recommended article: Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
Recommended article: Fast construction of irreducible polynomials over finite fields
description: scientific article; zbMATH DE number 7614566