In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov´asz, is considered as a LR method.
When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.