Lower bounds on the orders of subgroups connected with Agrawal conjecture

Authors

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

https://doi.org/10.15330/cmp.5.2.310-314

Keywords:

primality proving, finite field, multiplicative order

Published online: 2013-12-30

Abstract

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

Article

References

Article metrics

	No metrics available. see details

How to Cite

(1)

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

Download Citation

Most read articles by the same author(s)

V. Bovdi, A. Diene, R. Popovych, Elements of high order in finite fields specified by binomials , Carpathian Mathematical Publications: Vol. 14 No. 1 (2022)
R. Popovych, On the multiplicative order of elements in Wiedemann's towers of finite fields , Carpathian Mathematical Publications: Vol. 7 No. 2 (2015)