Abstract: In this paper are considered the mathematical aspects of cryptographic systems, i.e. checking of natural numbers for primality. The current situation of the primality criteria and its problems were analysed, and the necessity and the relevance of the study was identified. During the study an algorithm for constructing the new primality criteria based on the properties of the composition of ordinary generating functions with integer coefficients was introduced. Also, a software that will be used to search for new effective primality tests named Primality Criterion Generator was developed.
Keywords: prime, generating function, primality criterion, primality criterion generator
Authors and copyright holders:
—
For citation:
Shablya Yu. V., Kruchinin D. V., Shelupanov A. A. Generator of primality criteria based on properties of the composition of generating functions. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2015, no. 4(38), pp. 97–101.
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
