Johannes Buchmann, Volker Kessler  Home/Search
Context Related
| informatik.tudarm...educed_basis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.tud...DME.year.author (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-space and a lower bound for the first successive minimum calculates a reduced basis of that lattice. 1 (Update)
Similar documents based on text: More All
0.8: Computing a Reduced Lattice Basis From a Generating System - Buchmann, Kessler (1990) (Correct)
0.5: Sensitivity Analysis for General Equilibrium Problems - Bachem, Hochstättler, Wenzel (1992) (Correct)
0.4: Generating Convex Polyominoes at Random - Hochstättler, Loebl, Moll (1992) (Correct)
BibTeX entry: (Update)
J. Buchmann, V. Kessler, Computing a reduced lattice basis from a generating system with applications, Preprint 1990. http://citeseer.ist.psu.edu/buchmann93computing.html More
@misc{ buchmann90computing,
author = "J. Buchmann and V. Kessler",
title = "Computing a reduced lattice basis from a generating system with applications",
text = "J. Buchmann, V. Kessler, Computing a reduced lattice basis from a generating
system with applications, Preprint 1990.",
year = "1990",
url = "citeseer.ist.psu.edu/buchmann93computing.html" }
Citations (may not include all citations):227 Factoring polynomials with rational coefficients (context) - Lenstra, Jr et al. - 1982
50 The number field sieve - Lenstra, Jr et al. - 1990
45 Algorithmic algebraic number theory (context) - Pohst, Zassenhaus - 1990
8 A probabilistic class group and regulator algorithm and its .. (context) - Buchmann, Dullmann
8 Computing a lattice basis from a system of generating vector.. (context) - Buchmann, Pohst - 1989
Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html): More
On the Security of a Modified Paillier Public-Key Primitive - Sakurai, Takagi (2002) (Correct)
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Jr.. (Correct)
Efficient Undeniable Signature Schemes Based on Ideal.. - Biehl, Paulus, Takagi (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC