Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

1 Computer Science

1 2024

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: inverse of a polynomial modulo

Sortuj według:

Ogranicz wyniki do:

Finding the inverse of a polynomial modulo in the ring Z[X] based on the method of undetermined coefficients

100%

Yakymenko I. , Kasianchuk M. , Karpinski M. , Shevchuk R. , Shylinska I.

Computer Science

2024

tom T. 25 (2)

1--45

This paper presents the theoretical foundations of finding the inverse of a poly-nomial modulo in the ringZ[x]based on the method of undetermined coefficients. The use of the latter makes it possible to significantly reduce the timecomplexity of calculations avoiding the operation of finding the greatest common divisor. An example of calculating the inverse of a polynomial modulo inthe ringZ[x]based on the proposed approach is given. Analytical expressionsof the time complexities of the developed and classical methods depending onthe degrees of polynomials are built. The graphic dependence of the complexityof performing the operation of finding the inverse of a polynomial in the ringZ[x]is presented, which shows the advantages of the method based on unde-termined coefficients. It is found that the efficiency of the developed methodincreases logarithmically with an increase in the degrees of polynomials