Mod Log(離散対数問題) (math/combinatorics/mod-log.hpp)

• View this file on GitHub
• View document part on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Include: #include "math/combinatorics/mod-log.hpp"

概要

$a^x \equiv b \pmod p$ を満たす非負整数 $k$ の最小値を求める.

使い方

• mod_log(a, b, p): $a^x \equiv b \pmod p$ を満たす非負整数 $x$ の最小値を返す. ただし, 存在しない場合 $-1$ を返す.

計算量

• $O(\sqrt p)$

Verified with

• test/verify/yosupo-discrete-logarithm-mod.test.cpp

Code

/**
 * @brief Mod Log(離散対数問題)
 *
 */
int64_t mod_log(int64_t a, int64_t b, int64_t p) {
  int64_t g = 1;

  for (int64_t i = p; i; i /= 2) (g *= a) %= p;
  g = __gcd(g, p);

  int64_t t = 1, c = 0;
  for (; t % g; c++) {
    if (t == b) return c;
    (t *= a) %= p;
  }
  if (b % g) return -1;

  t /= g;
  b /= g;

  int64_t n = p / g, h = 0, gs = 1;

  for (; h * h < n; h++) (gs *= a) %= n;

  unordered_map<int64_t, int64_t> bs;
  for (int64_t s = 0, e = b; s < h; bs[e] = ++s) {
    (e *= a) %= n;
  }

  for (int64_t s = 0, e = t; s < n;) {
    (e *= gs) %= n;
    s += h;
    if (bs.count(e)) return c + s - bs[e];
  }
  return -1;
}

#line 1 "math/combinatorics/mod-log.hpp"
/**
 * @brief Mod Log(離散対数問題)
 *
 */
int64_t mod_log(int64_t a, int64_t b, int64_t p) {
  int64_t g = 1;

  for (int64_t i = p; i; i /= 2) (g *= a) %= p;
  g = __gcd(g, p);

  int64_t t = 1, c = 0;
  for (; t % g; c++) {
    if (t == b) return c;
    (t *= a) %= p;
  }
  if (b % g) return -1;

  t /= g;
  b /= g;

  int64_t n = p / g, h = 0, gs = 1;

  for (; h * h < n; h++) (gs *= a) %= n;

  unordered_map<int64_t, int64_t> bs;
  for (int64_t s = 0, e = b; s < h; bs[e] = ++s) {
    (e *= a) %= n;
  }

  for (int64_t s = 0, e = t; s < n;) {
    (e *= gs) %= n;
    s += h;
    if (bs.count(e)) return c + s - bs[e];
  }
  return -1;
}

Back to top page