Lower bounds on the orders of subgroups connected with Agrawal conjecture

R. Popovych


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


primality proving, finite field, multiplicative order

Full Text: Article References
3 :: 5


  • There are currently no refbacks.

Creative Commons License
The journal is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported.