Lower bounds on the orders of subgroups connected with Agrawal conjecture

Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.

Bibliographic Details
Main Author: R. Popovych
Format: Article
Language:English
Published: Vasyl Stefanyk Precarpathian National University 2013-12-01
Series:Karpatsʹkì Matematičnì Publìkacìï
Subjects:
Online Access:https://journals.pnu.edu.ua/index.php/cmp/article/view/1322
Description
Summary:Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.
ISSN:2075-9827
2313-0210