On pairwise Gaussian bases and LLL algorithm for three dimensional lattices

DOI10.4134/JKMS.J210496MaRDI QIDQ5053992zbMATH OpenFDO

Authors Kitae Kim, Hyang-Sook Lee, Seongan Lim, Jeongeun Park, Ikkwon Yie

Publication date 29 November 2022

Full work available at URL https://doi.org/10.4134/JKMS.J210496

zbMATH Keywords

latticelattice basis reductionLLLpairwise-Gaussian basis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1857498
• Gauss' algorithm revisited
• Lattice size and generalized basis reduction in dimension three
• An affine point of view on minima finding in integer lattices of lower dimensions
• Algorithmic Number Theory

Cites work

• An Introduction to Mathematical Cryptography
• BKZ 2.0: Better lattice security estimates
• Factoring polynomials with rational coefficients
• Faster exponential time algorithms for the shortest vector problem
• scientific article; zbMATH DE number 3937234 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 1857498 (Why is no real title available?)
• Low-dimensional lattice basis reduction revisited
• New orthogonality criterion for shortest vector of lattices and its applications
• On Nearly Orthogonal Lattice Bases and Random Lattices

Cited in

(1)

• Lattice size and generalized basis reduction in dimension three

Describes a project that uses

Uses Software

• BKZ

This page was built for publication: On pairwise Gaussian bases and LLL algorithm for three dimensional lattices

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