Improved computation of polynomial roots over number fields when using complex embeddings

DOI10.1016/J.JACA.2024.100026MaRDI QIDQ6671812

Andrea Lesavourey, Thomas Plantard, Willy Susilo

Publication date: 27 January 2025

Published in: Journal of Computational Algebra (Search for Journal in Brave)

zbMATH Keywords

number fieldsLLL algorithmpolynomial rootscomplex embeddingsrelative extensions

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Computational number theory (11Yxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topics in computational algebraic number theory
• Isomorphisms of algebraic number fields
• Factoring polynomials over global fields
• On Lovász' lattice reduction and the nearest lattice point problem
• The Magma algebra system. I: The user language
• Short principal ideal problem in multicubic fields
• Towards faster polynomial-time lattice reduction
• Approx-SVP in ideal lattices with pre-processing
• Factoring polynomials over global fields. I
• A relative van Hoeij algorithm over number fields
• Polynomial factorization algorithms over number fields
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
• New techniques for computing the ideal class group and a system of fundamental units in number fields
• Square Root Algorithms for the Number Field Sieve
• An LLL Algorithm with Quadratic Complexity
• Floating-Point LLL: Theoretical and Practical Aspects
• Short Generators Without Quantum Computers: The Case of Multiquadratics
• Recovering Short Generators of Principal Ideals in Cyclotomic Rings
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
• Fast practical lattice reduction through iterated compression
• On the hardness of the NTRU problem
• Fast multiquadratic S-unit computation and application to the calculation of class groups
• Norm relations and computational problems in number fields

This page was built for publication: Improved computation of polynomial roots over number fields when using complex embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671812)