Lower bounds on the orders of subgroups connected with Agrawal conjecture


  • R. Popovych Lviv Polytechnic National University, 12 Bandera str., 79013, Lviv, Ukraine


primality proving, finite field, multiplicative order
Published online: 2013-12-30


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

Article metrics
How to Cite
Popovych, R. Lower Bounds on the Orders of Subgroups Connected With Agrawal Conjecture. Carpathian Math. Publ. 2013, 5, 310-314.