Posts Tagged ‘finite abelian group’
Finding Lattice Points, Finite Abelian Groups, and Explaining Algorithms.
friday, january 29th, 2010We 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.
Infrastructures and Global Fields.
thursday, july 23rd, 2009The following posts give an introduction to infrastructures and how to obtain these from global fields: The Discrete Logarithm Problem and Generalizations. One-dimensional Infrastructures. Interpreting One-dimensional Infrastructures as Groups: f-Representations. n-dimensional Infrastructures. How to Obtain Reduction Maps for n-dimensional Infrastructures. Obtaining Infrastructures from Global Fields. See also my article on infrastructures at Wikipedia.
n-dimensional Infrastructures.
monday, july 20th, 2009We 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.
