CRYPTO NEWS

Core Scientific increased Bitcoin production by 10% in July amid Texas power cuts

The mining firm reported it “completely powered-down its Texas data center operations on several occasions” in July to support the state’s power grid operator.

Bruteforcing the discrete logarithm with a decomposable prime modulus

I came across an interesting challenge recently. I need to find x such as : $s=n^x mod m$ We suppose we have $s, n$ and $m$. The modulus $m$ is prime and $n$ is a primitive root modulo $m$. The interesting property is that $m$ can be written as $m=a^2+b^2+c^2+d^2$ where $a,b,c,d$ are integers. Given::Listen

I came across an interesting challenge recently. I need to find x such as :
$s=n^x mod m$

We suppose we have $s, n$ and $m$. The modulus $m$ is prime and $n$ is a primitive root modulo $m$.

The interesting property is that $m$ can be written as $m=a^2+b^2+c^2+d^2$ where $a,b,c,d$ are integers.

Given the decomposition of $m$ above, is there a way to bruteforce or simply solve for $x$ ?

Core Scientific increased Bitcoin production by 10% in July amid Texas power cuts

Shopping cart
There are no products in the cart!
Continue shopping
0