Let be a numerical semigroup. In this work we show that is a distributive lattice, which in addition is a Frobenius restricted variety. We give an algorithm which allows us to compute the set for a given As a consequence, we obtain another algorithm that computes all the elements of with a fixed genus.
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...