Solving $a = b^x \mod c$ where $a$, $b$, and $c$ are large integers

Asked Feb 21 '14 at 21:04

Active Feb 21 '14 at 21:09

Viewed 404 times

I am trying to solve this problem :

Given $a$, $b$, $c$ integers (that could be very large), find $x$ integer such as :

$a=b^x \mod c$

I tried by coding in C a loop checking the equality and incrementing x, but I assume they are faster ways to do that. What are the best exisiting algorithms for solving this problem, with big $a$, $b$ and $c$ ?

edited Feb 21 '14 at 21:09

asked Feb 21 '14 at 21:04

oursay

3

This is the discrete logarithm problem and best solved by either inventing a quantum computer or finding a job at the NSA. – Hagen von Eitzen Feb 21 '14 at 21:05

Solving $a = b^x \mod c$ where $a$, $b$, and $c$ are large integers

0 Answers0