# Tag Info

### Why is discrete logarithm not quantum proof?

The problem is by definition modular, and the equation is $$g^x\equiv h \pmod p$$ for the integer case. This equation a single solution since the map $x \mapsto g^x \pmod p$ is one to one. Thus there ...
• 22.8k

### RSA like problem with unknown e and d

If I understand correctly, it's a DLP (Discrete Logarithm Problem) to find that value. I may make it somewhat easier if I try to solve the DLP for p and q respectively, but for ~500 bits, it's still a ...
• 148k
Accepted

### Given a random point on a curve defined over a prime field, is it possible to compute 2 different scalar that will lead to the same result?

Consider an Edwards curve with equation $x^2+y^2=d\,x^2y^2$ in the field $\mathbb F_p$, with prime $p\bmod 4=1$, integer $d$ with $d^{(p-1)/2}\bmod p=p-1$. The group law is \bigl(x_1,y_1\bigr)+\bigl(...
• 142k

### Given a random point on a curve defined over a prime field, is it possible to compute 2 different scalar that will lead to the same result?

does 2 scalars $S1$ $S2$ exist such as $packed(S1\cdot P)= packed(S2\cdot P$) $S1 = S2$ is equivalent to the statement that $S1 - S2$ is an integer multiple of the order of $P$. $S1 \ne S2$ If ...
• 148k
1 vote

• 22.8k
1 vote

### Why is discrete logarithm not quantum proof?

The input and output are all over a finite field. There is no need to find a specific value. We find the value mod p, which as you say can be viewed as an infinite collection of natural numbers all ...
• 11.8k

Only top scored, non community-wiki answers of a minimum length are eligible