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.
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 |
Similar Items
-
On the multiplicative order of elements in Wiedemann's towers of finite fields
by: R. Popovych
Published: (2015-12-01) -
Elements of high order in finite fields specified by binomials
by: V. Bovdi, et al.
Published: (2022-06-01) -
Formal Verification of Fractional-Order PID Control Systems Using Higher-Order Logic
by: Chunna Zhao, et al.
Published: (2022-08-01) -
A total variable-order variation model for image denoising
by: Abdelilah Hakim, et al.
Published: (2019-09-01) -
On the Number of Witnesses in the Miller–Rabin Primality Test
by: Shamil Talgatovich Ishmukhametov, et al.
Published: (2020-06-01)