The method of constructing algorithms for primality testing natural numbers for the objectives of information security

Download article in PDF format

Authors: Kruchinin D. V., Kruchinin V. V.

Annotation: 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

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

  journal@tusur.ru

 

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

  vnmas@tusur.ru

Subscription for updates