Lower bounds on the orders of subgroups connected with Agrawal conjecture
DOI:
https://doi.org/10.15330/cmp.5.2.310-314Keywords:
primality proving, finite field, multiplicative orderAbstract
Explicit lower bounds are obtained on the multiplicative orders of subgroups of a finite field connected with primality proving algorithm.Downloads
Additional Files
Published
2013-12-30
How to Cite
(1)
Popovych, R. Lower Bounds on the Orders of Subgroups Connected With Agrawal Conjecture. Carpathian Math. Publ. 2013, 5, 310-314.
Issue
Section
Scientific articles