Explicit factorization of x^2nd-1 over a finite field

2018/07/01 by Manjit Singh, Singh, Manjit
Computer Science · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Algebraic Geometry and Number Theory

paper · pdf · doi:10.48550/arxiv.1807.00274

Abstract

Let \mathbbF_q be a finite field of odd characteristic containing q elements and integer n≥ 1. In this paper, the explicit factorization of x^2nd-1 over \mathbbF_q is obtained when d is an odd divisor of q+1.

Related

• Explicit factorization of xⁿ-1∈ \mathbb F_q[x]
• Further factorization of xⁿ-1 over a finite field
• Further factorization of xⁿ-1 over finite fields (II)
• Factorization of composed polynomials and applications
• Some subgroups of a finite field and their applications for obtaining\n explicit factors