Primitive roots from a natural number n (i.e. generators of the multiplicative group Zn∗) play an important role in many cryptographic algorithms like public
key ciphers, digital signatures and key agreement algorithms. In the paper, proof of
correctness of the probabilistic algorithm for finding primitive roots is given along with
assessment of its average computational complexity. Results obtained for the multiplicative group Zn∗ can be in natural easy way generalized on the case of arbitrary finite
cyclic groups.
REFERENCES(10)
1.
V. Shoup, A computational Introduction to Number Theory and Algebra, Cambridge University Press, 2008.
A. Paszkiewicz, Badania własności liczb pierwszych i wielomianów nieprzywiedlnych pod kątem zastosowania w telekomunikacji, Oficyna Wydawnicza P.W.; Warszawa 2012.
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.