Abstract: The experimental investigation of the performance of the generation algorithms of the prime numbers has been carried out. These algorithms are based on the methods of trial divisions, Miller-Rabin, Soloway - Strassen and minor Fermat’s theorem, using the filter of division into small prime number. For each type of the method the dependences of the time generation on the byte length have been plotted on the assumption of averaging of the large ensemble of partial realizations.
For citation:
Kukalo I. A., Miklin P. A., Litvinov R. V. Algorithms of generation of the pseudo prime numbers in «Borland C++ 3.1». Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2007, no. 1(15), pp. 24–28.
Authors and copyright holders:
—
Last issue
-2026-1_%D0%BA%D0%BE%D0%BF%D0%B8%D1%8F.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
