Algorithmic Number Theory

DOI10.1007/11792086zbMATH Open1143.11336OpenAlexW2977481208MaRDI QIDQ5899253FDOQ5899253

Authors: Johannes Buchmann, Christoph Ludwig 

Publication date: 2 May 2007

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

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

Recommendations

• scientific article; zbMATH DE number 1962809
• Practical, Predictable Lattice Basis Reduction
• Random sampling revisited: lattice enumeration with discrete pruning
• scientific article; zbMATH DE number 1643923
• Generating shorter bases for hard random lattices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16) Relations with coding theory (11H71)

Cited In (9)

• Practical, Predictable Lattice Basis Reduction
• Title not available (Why is that?)
• Random sampling revisited: lattice enumeration with discrete pruning
• Second order statistical behavior of LLL and BKZ
• Analysis of the Binary Asymmetric Joint Sparse Form
• Explicit Hard Instances of the Shortest Vector Problem
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• A Computable Fourier Condition Generating Alias-Free Sampling Lattices
• Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors

Uses Software

• NTL

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 Q5899253)