Further factorization of x^n-1 over finite fields (II)

12/15/2020
by   Yansheng Wu, et al.
0

Let F_q be a finite field with q elements. Let n be a positive integer with radical rad(n), namely, the product of distinct prime divisors of n. If the order of q modulo rad(n) is either 1 or a prime, then the irreducible factorization and a counting formula of irreducible factors of x^n-1 over F_q were obtained by Martínez, Vergara, and Oliveira (Des Codes Cryptogr 77 (1) : 277-286, 2015) and Wu, Yue, and Fan (Finite Fields Appl 54: 197-215, 2018). In this paper, we explicitly factorize x^n-1 into irreducible factors in F_q[x] and calculate the number of the irreducible factors when the order of q modulo rad(n) is a product of two primes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2020

Exceptional scatteredness in prime degree

Let q be an odd prime power and n be a positive integer. Let ℓ∈F_q^n[x] ...
research
06/27/2018

Weight distributions of all irreducible μ-constacyclic codes of length ℓ^n

Let F_q be a finite field of order q and integer n> 1. Let ℓ be a prime ...
research
05/10/2023

Private Product Computation using Quantum Entanglement

In this work, we show that a pair of entangled qubits can be used to com...
research
01/31/2022

A new idea for RSA backdoors

This article proposes a new method to inject backdoors in RSA and other ...
research
04/27/2021

Finding discrete logarithm in F_p^*

Difficulty of calculation of discrete logarithm for any arbitrary Field ...
research
06/12/2018

Using Chaos in Grey Wolf Optimizer and Application to Prime Factorization

The Grey Wolf Optimizer (GWO) is a swarm intelligence meta-heuristic alg...
research
11/09/2019

Boundary-type Sets of Strong Product of Directed Graphs

Let D=(V,E) be a strongly connected digraph and let u ,v∈ V(D). The maxi...

Please sign up or login with your details

Forgot password? Click here to reset