Nearest lattice point algorithms on semi \(k\)-reduced basis (Q866044)

From MaRDI portal





scientific article
Language Label Description Also known as
English
Nearest lattice point algorithms on semi \(k\)-reduced basis
scientific article

    Statements

    Nearest lattice point algorithms on semi \(k\)-reduced basis (English)
    0 references
    0 references
    0 references
    20 February 2007
    0 references
    In this paper, we firstly generalize the relations among the basis vectors of LLL reduced basis to semik-reduced basis. Then we analyze the complexities of the nearest plane algorithm and round-off algorithm on semik-reduced basis, which, compared with L. Babai's results on LLL reduced basis, have better approximate ratios and contain almost the same time complexities.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references