We compare the tasks of finding points of a lattice, computing the structure of finite abelian groups and explaining algorithms. We show up relations between these three topics and, as an example, depict the baby-step giant-step algorithm for order computation, as well as Terr's modification of this algorithm.

# Posts about finite abelian group.

We will introduce n-dimensional infrastructures and briefly discuss reductions, f-representations and giant steps. We will also discuss how infrastructures can be obtained from finite abelian groups.