Skip to main content
SpringerLink
Log in

Number-Theoretical Methods of Factoring Composite Numbers and Calculating the Discrete Logarithm

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The article is devoted to the new application of number-theoretic transforms. Representing number systems by these transforms allows us to create fundamentally new and efficient algorithms for factoring numbers and to calculate period of the exponential function and of the discrete logarithm. The factorization algorithm allows us to decompose any finite product into factors in one run, it is an exact test of number simplicity. This algorithm is based on representing number systems by a number-theoretic transforms and has no analogs in the world since it uses only simple arithmetic operations. Properties of number simplicity or other number properties are not applied. Thus, number factoring and calculations of the exponential function period and of the discrete logarithm are simple arithmetic operations that are performed in a finite time and belong to the complexity class P.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sh. T. Ishmukhamedov and R. G. Rubtsova, “On the complexity of the factorization problem for natural numbers,” Vestnik TGGPU, Nos. 2–3, 4–6, Kazan’ (2007).

  2. M. V. Semotyuk, “An analytical method for factoring composite numbers,” Komp’yuterni Zasoby, Merezhi ta Systemy, No. 12, 5–10, V. M. Glushkov Inst. of Cybernetics, NAS of Ukraine, Kyiv (2013).

  3. M. V. Semotiuk, Notes on Machine Algebra [in Russian], Stal’, Kyiv (2012).

    Google Scholar 

  4. M. V. Semotiuk, “Generalized number-theoretic transformation,” Prepr. NAS of Ukraine, V. M. Glushkov Inst. of Cybernetics, No. 94-8, Kyiv (1994).

  5. M. V. Semotiuk, “Number-theoretic representations of number systems,” Upravl. Sistemy i Mashiny, No. 5, 36–42 (2004).

  6. B. L. van der Waerden, Algebra, Springer, New York (1991).

    Book  Google Scholar 

  7. V. D. Nogin, Introduction toMathematical Analysis [in Russian], Sankt-Peterb. Gos. Politekhn. Un-t., St. Petersburg (1994).

    Google Scholar 

  8. C. D. Olds, A. Lax, and G. P. Davidoff, The Geometry of Numbers, Math. Assoc. Amer., Washington, DC (2000).

    Book  Google Scholar 

  9. N. Koblitz, Course in Number Theory and Cryptography, Springer-Verlag, New York (1994).

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    M. V. Semotiuk

Authors
  1. M. V. Semotiuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Semotiuk.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 2, March–April, 2022, pp. 178–188.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Semotiuk, M.V. Number-Theoretical Methods of Factoring Composite Numbers and Calculating the Discrete Logarithm. Cybern Syst Anal 58, 309–318 (2022). https://doi.org/10.1007/s10559-022-00463-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-022-00463-0

Keywords

Search

Navigation