Abstract: We offer a method of algorithms development for testing the primality of natural numbers by using the apparatus of ordinary generating functions and operations of superposition of functions ln (1 + F (x)), where F (x) is an ordinary generating function with integer coefficients. The relation is shown between the existing algorithms for testing primality to the proposed method. There are given the examples of the development of new algorithms for testing primality by the proposed method.
Keywords: primality testing, logarithmic generating function, superposition of generating functions
Authors and copyright holders:
—
For citation:
Kruchinin D. V., Kruchinin V. V. The method of constructing algorithms for primality testing natural numbers for the objectives of information security. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2011, no. 2(24), – p. 2. pp. 247–251.
Last issue
-2025-1.jpg)
Editorial office address
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02
Subscription for updates
