Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1125.11361OpenAlexW2791103999MaRDI QIDQ5465634FDOQ5465634

Authors: 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

Recommendations

• Low-dimensional lattice basis reduction revisited
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• scientific article; zbMATH DE number 3958726
• Reduction of lattice bases for arbitrary norms
• scientific article; zbMATH DE number 1857498

Mathematics Subject Classification ID

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

Cited In (27)

• On the isogeny problem with torsion point information
• Volumes for \(\text{SL}_N(\mathbb{R})\), the Selberg integral and random lattices
• Second order monotone finite differences discretization of linear anisotropic differential operators
• Volumes and distributions for random unimodular complex and quaternion lattices
• Practical, Predictable Lattice Basis Reduction
• Minimal stencils for discretizations of anisotropic PDEs preserving causality or the maximum principle
• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
• Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
• Title not available (Why is that?)
• Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
• Title not available (Why is that?)
• On the successive minima of subbases of low-dimensional lattices
• On the Security of Supersingular Isogeny Cryptosystems
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• An affine point of view on minima finding in integer lattices of lower dimensions
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• Smallest Reduction Matrix of Binary Quadratic Forms
• Hermite’s Constant and Lattice Algorithms
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• Fast-marching methods for curvature penalized shortest paths
• Low-dimensional lattice basis reduction revisited
• Lattice basis reduction for indefinite forms and an application
• Title not available (Why is that?)
• Systematics of aligned axions
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Riemannian fast-marching on cartesian grids, using Voronoi's first reduction of quadratic forms

This page was built for publication: Algorithmic Number Theory

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