Algorithmic Number Theory

DOI10.1007/b98210zbMath1125.11361OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465634

Phong Q. Nguyen, Damien Stehlé

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98210

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items

On the Isogeny Problem with Torsion Point Information, Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors, On the Security of Supersingular Isogeny Cryptosystems, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, On lattice-based algebraic feedback shift registers synthesis for multisequences, Systematics of aligned axions, Volumes for \(\text{SL}_N(\mathbb{R})\), the Selberg integral and random lattices, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, Volumes and distributions for random unimodular complex and quaternion lattices, Smallest Reduction Matrix of Binary Quadratic Forms, Hermite’s Constant and Lattice Algorithms, Second order monotone finite differences discretization of linear anisotropic differential operators, Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures, Fast-marching methods for curvature penalized shortest paths, Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle, Four-dimensional Gallant-Lambert-Vanstone scalar multiplication, Riemannian Fast-Marching on Cartesian Grids, Using Voronoi's First Reduction of Quadratic Forms