The Power of Leibniz-Like Functions as Oracles

  • Jaeyoon Kim
  • Ilya VolkovichEmail author
  • Nelson Xuzhi Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12159)


A Leibniz-like function \(\chi \) is an arithmetic function (i.e., \(\chi : \mathbb {N}\rightarrow \mathbb {N}\)) satisfying the product rule (which is also known as “Leibniz’s rule”): \(\chi (MN) = \chi (M) \cdot N + M \cdot \chi (N)\). In this paper we study the computational power of efficient algorithms that are given oracle access to such functions. Among the results, we show that certain families of Leibniz-like functions can be use to factor integers, while many other families can used to compute the radicals of integers and other number-theoretic functions which are believed to be as hard as integer factorization [1, 2].


Integer factorization Number-theoretic functions Square-free integers Möbius function Oracles 



The authors would also like to thank the anonymous referees for their detailed comments and suggestions.


  1. 1.
    Adleman, L.M., McCurley, K.S.: Open problems in number theoretic complexity, II. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291–322. Springer, Heidelberg (1994). Scholar
  2. 2.
    Bach, E.: Intractable problems in number theory. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 77–93. Springer, New York (1990). Scholar
  3. 3.
    Bach, E., Driscoll, J.R., Shallit, J.: Factor refinement. J. Algorithms 15(2), 199–222 (1993). Scholar
  4. 4.
    Bach, E., Miller, G.L., Shallit, J.: Sums of divisors, perfect numbers and factoring. SIAM J. Comput. 15(4), 1143–1154 (1986). Scholar
  5. 5.
    Bernstein, D.: Factoring into coprimes in essentially linear time. J. Algorithms 54(1), 1–30 (2005). Scholar
  6. 6.
    Gathen, J.V.Z.: Who was who in polynomial factorization. In: Trager, B.M. (ed.) Symbolic and Algebraic Computation, International Symposium, ISSAC. p. 2. ACM (2006).
  7. 7.
    Kaltofen, E.: Polynomial factorization: a success story. In: Sendra, J.R. (ed.) Symbolic and Algebraic Computation, International Symposium, ISSAC. pp. 3–4. ACM (2003).
  8. 8.
    Landau, S.: Some remarks on computing the square parts of integers. Inf. Comput. 78(3), 246–253 (1988). Scholar
  9. 9.
    Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515–534 (1982)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Syst. Sci. 13(3), 300–317 (1976). Scholar
  11. 11.
    Morain, F., Renault, G., Smith, B.: Deterministic factoring with oracles. CoRR abs/1802.08444 (2018).
  12. 12.
    Shallit, J., Shamir, A.: Number-theoretic functions which are equivalent to number of divisors. Inf. Process. Lett. 20(3), 151–153 (1985). Scholar
  13. 13.
    Woll, H.: Reductions among number theoretic problems. Inf. Comput. 72(3), 167–179 (1987). Scholar
  14. 14.
    Yun, D.Y.Y.: On square-free decomposition algorithms. In: SYMSAC 1976, Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, Yorktown Heights, New York, USA, 10–12 August 1976, pp. 26–35. ACM (1976).

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.CSE DivisionUniversity of MichiganAnn ArborUSA

Personalised recommendations