ALGORITHMIC PROCESSES OF THE LARGE NUMBERS FACTORIZATION BASED ON THE THEORY OF ELLIPTIC CURVES

DOI: https://doi.org/10.15276/eltecs.28.104.2018.27

Abstract

In this article we consider the problem of the composite numbers factorization. Various methods for solving this problem were described and also their comparative characteristics were given. The
Lenstra method algorithm was analyzed and described in detail. The ways of its optimization were given

Author Biographies

George Vostrov, Odessa national polytechnic university

Ph. D. of Technical Sciences, Associate Professor of the Department of Applied Mathematics and Information Technologies, Odessa National Polytechnic University

Ivan Dermenji, Odessa National Polytechnic University

Student of the Department of Applied Mathematics and Information
Technologies, Odessa National Polytechnic University

Published
2018-06-26
Issue
No. 28(104) (2018): Electrotechnic and Computer Systems
Section
Dynamic Systems' Modelling

Most read articles by the same author(s)

1 2 > >>