3 research outputs found
Computing Multiplicative Order and Primitive Root in Finite Cyclic Group
Multiplicative order of an element of group is the least positive
integer such that , where is the identity element of . If the
order of an element is equal to , it is called generator or primitive
root. This paper describes the algorithms for computing multiplicative order
and primitive root in , we also present a logarithmic
improvement over classical algorithms.Comment: 8 page
GCD Computation of n Integers
Greatest Common Divisor (GCD) computation is one of the most important
operation of algorithmic number theory. In this paper we present the algorithms
for GCD computation of integers. We extend the Euclid's algorithm and
binary GCD algorithm to compute the GCD of more than two integers.Comment: RAECS 201