summaryrefslogtreecommitdiff
path: root/content/math/discreteLogarithm.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
commit98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch)
tree5113d5cc24d1ad5f93810b6442ce584a36950dc8 /content/math/discreteLogarithm.cpp
parentad3856a6b766087df0036de0b556f4700a6498c9 (diff)
parent8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff)
mzuenni tests
Diffstat (limited to 'content/math/discreteLogarithm.cpp')
-rw-r--r--content/math/discreteLogarithm.cpp17
1 files changed, 17 insertions, 0 deletions
diff --git a/content/math/discreteLogarithm.cpp b/content/math/discreteLogarithm.cpp
new file mode 100644
index 0000000..68866e0
--- /dev/null
+++ b/content/math/discreteLogarithm.cpp
@@ -0,0 +1,17 @@
+ll dlog(ll a, ll b, ll m) { //a > 0!
+ ll bound = sqrtl(m) + 1; //memory usage bound < p
+ vector<pair<ll, ll>> vals(bound);
+ for (ll i = 0, e = 1; i < bound; i++, e = (e * a) % m) {
+ vals[i] = {e, i};
+ }
+ vals.emplace_back(m, 0);
+ sort(all(vals));
+ ll fact = powMod(a, m - bound - 1, m);
+
+ for (ll i = 0; i < m; i += bound, b = (b * fact) % m) {
+ auto it = lower_bound(all(vals), pair<ll, ll>{b, 0});
+ if (it->first == b) {
+ return (i + it->second) % m;
+ }}
+ return -1;
+}