2010/08/05 by Roman Popovych, Popovych, Roman
Computer Science · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Mathematics #Finite Group Theory Research #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1008.0972
openalex publication_date 2010/08/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We obtain explicit lower bounds on multiplicative order of elements that have more general form than finite field Gauss period. In a partial case of Gauss period this bound improves the previous bound of O.Ahmadi, I.E.Shparlinski and J.F.Voloch