Abstract
Let be an irreducible polynomial of degree and exponent , and be a positive integer such that for all prime divisor of . We show a fast algorithm to determine the irreducible factors of . We also show the irreducible factors in the case when divides and . Finally, using this algorithm we split into irreducible factors, in the case when and is a generator of the group .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.