Scientific and Technical Journal

ELECTROTECHNIC AND COMPUTER SYSTEMS

ISSN Print 2221-3937
ISSN Online 2221-3805
MODELING THE FORMATION PROCESSES OF FACTORIZATION ALGORITHMS BASED ON THE ELLIPTIC CURVES THEORY
Abstract:

This paper describes the problem of factorization. It indicates the fundamental place of this problem in a number of purely mathematical and applied sciences. The structure of factorization classes methods is analyzed, the choice of the approach based on the elliptic curves theory is substantiated. The algorithm of elliptic curves is described and analyzed in detail. The paper describes the problem of the relationship between the generated curves number and the necessary boundary of the basic method of elliptic curves. The research of this problem are made by method software implementation. Results of this research are represented.

Authors:
Keywords
References
  1. Pomerance, C. B., (2008), Smooth numbers and the quadratic sieve, Cambridge University Press, New York: Algorithmic Number Theory MSRI Publications Volume 44, pp. 1‒14.
  2. Chernov, V. M., Chicheva, M. A, (2001), Algebraic arithmetic methods for the synthesis of fast algorithms for discrete orthogonal transformations[Algebraicheskie arifmeticheskie metody dlya sinteza bystryh algoritmov diskretnyh ortogonalnyh preobrazovanij], publishing house: Nauka, Moscow, pp. 301‒384.
  3. Complexity Zoo, (2008),Wayback Machine Class SUBEXP: Deterministic Subexponential-Time, available at: https://complexityzoo.uwaterloo.ca/Complexity_Zoo:S#subexp.
  4. Regev, O., (2004), A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space, available at: https://arxiv.org/abs/quant-ph/0406151.
  5. Crandall, R. E., Pomerance, C. B., (2001), Prime numbers: A Computational Perspective, Springer-Verlag, New York, pp. 293‒420.
  6. Lenstra, H. W., (1987), Factoting integers with elliptic curves, Annual of Mathematics Volume 126, New-Jersey, pp. 649‒673.
  7. Ishmukhametov, Sh. T., (2011), Methods for the factorization of natural numbers[Metody faktorizacii naturalnyh chisel], Kazan. UN., Kazan, pp. 83‒103.
  8. Koblitz, N., (1996), Introduction To Elliptic Curves And Modular Forms, Second Edition, Springer-Verlag, New York, pp. 9‒56.
  9. Canfield, E., Erdős, P., Pomerance, C. B., (1983), On a Problem of Oppenheim concerning "Factorisatio Numerorum", Elsevier, Amsterdam, Journal of number theory Volume 17, pp. 29‒36.
  10. Efimov, S. S., Makarenko, A. V., Pykhteev, A. V., (2012), Parallel implementation and comparative analysis of factorization algorithms with distributed memory, [Parallel'naya realizatsiya i sravnitel'nyy analiz algoritmov faktorizatsii s raspredelennoy pamyat'yu], Omsk State University. F. M. Dostoyevsky, Omsk, Mathematical structures and modeling Volume 26, pp. 94‒109.
  11. Pritchard, P., (1987), Linear prime-number sieves: a family tree, Elseiver, Amsterdam, Sci. Comput. Programming 9:1 pp. 17–35.
Published:
Last download:
14 Nov 2019

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014-2018. Any use of information from the site is possible only under the condition that the source link! ]