FACTORIZATION OF THE DEGREE OF SPHENIC POLYNOMES
DOI:
https://doi.org/10.18372/2410-7840.24.16860Keywords:
irreducible polynomials, sphenic polynomials, modulo comparabilityAbstract
By sphenic polynomials, we mean polynomials formed by the product of three (not necessarily different) irreducible polynomials with a priori unknown degree. The study's main goal is to develop an effective algorithm for factorizing degrees of sphenic polynomials with minimal computational complexity. Different solutions to the problem of factorization degrees of sphenic polynomials depending on the ratio degree of the cycle period of these polynomials consider. The sphenic polynomial cycle period defines as a parameter equal to the number of non-repeating subtractions computed on the linear-logarithmic scale of the group formed by the sphenic polynomial. The proposed algorithm is invariant to the characteristics of the Galois fields generated by the multipliers of sphenic polynomials. Numerous numerical examples confirm the correctness of the results. Directions for further research outlines.
References
Сфеническое число. Wikipedia [online], Available at: https://dic.academic.ru/dic.nsf/ ruwiki/1644009.
Сфеническое число. Wikipedia [online], Available at: https://wikisko.ru/wiki/Sphenic_number.
Шпаринский И.Е. О некоторых вопросах теории конечных полей, УМН, 46:1(277) (1991). — С. 165-200. Wikipedia [online], Available at: www.mathnet.ru/links/c42de5a12c7ae9608284aece3963a1fa/rm4570.pdf.
Gerald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory. Cambridge University Press, (2004). ISBN 978-0-521-41261-2
Полупростое число. Wikipedia [online], Available at: https://wiki5.ru/wiki/Semiprime.
Anatoly Beletsky. Factorization of the Degree of Semisimple Polynomials of one Variable over the Galois Fields of Arbitrary Characteristics. WSEAS Transactions on Mathematics. Vol. 21, 2022, Art. 23, p.p. 160-172. DOI: 10.37394/23206.2022.21.23.
Ишмухаметов Ш.Т. Методы факторизации натуральных чисел. – Казань: Казанский ун-т. 2011. – 190 с.
Bach E., Shallit J. Factoring with cyclotomic polynomials. – Math. Comp. 1989. v.52(185), p. 201–219.
Schneier B., Applied cryptography, Second Edition: Protocols, Algorithms, and Source Code in C+. John Wiley & Sons, New York (1996).
Chervyakov N.I., Kolyada A.A., Lyakhov P.A. Modular arithmetic and its applications in Infocommunication technologies. – M.: Fizmatlit, 2017. – 400 p.
Henri Cohen. A course in computational algebraic number theory. Berlin, Springer, 1996. – 545 p.
Anatoly Beletsky. An Effective Algorithm for the Synthesis of Irreducible Polynomials over a Galois Fields of Arbitrary Characteristics. WSEAS Transactions on Mathematics. VOL 20, 2021. – pp. 508-519. DOI: 10.37394/23206.2021.20.54.
Lidl R., Niederreiter H. Finite Fields. Cambridge University Press (1996).
Круглые числа. Wikipedia [online], Available at: https://dic.academic.ru/dic.nsf/ruwiki/ 180635.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
