We give the definition of one-dimensional infrastructures and construct baby and giant steps. Moreover, we show that one-dimensional infrastructures generalize finite cyclic groups. Finally, we give some remarks on our choice of the giant step definition.
Posts about DLP.
We discuss the discrete logarithm problem, its use in cryptography, and two possible directions of generalization to other algebraic structures.