All Questions
8 questions
1
vote
0
answers
113
views
Is generating random blake256 hashes until packed points is on the curve, a safe algorithm to avoid the discrete log between the generated points?
I know there’re many questions that ask how to safely HashToCurve, but I want to know if the method I found in an actual implementation is secured against the ...
- 329
2
votes
2
answers
589
views
Best Known Attacks on Discrete Logarithm in Generic Groups
This is a followup to my recent question Discrete Logarithm Challenges and Records.
I am interested in confirming my understandings from the answer to that question, stated below:
For a discrete ...
- 23.7k
3
votes
1
answer
612
views
Excluding specific factors for Pohlig-Hellman
I want to use Pohlig-Hellman and BSGS to solve the discrete log of an Elliptic Curve which has a composite order generator.
The ...
- 1,454
1
vote
1
answer
177
views
Elliptic curve representation
According to this page, Edward's curve point doubling can be represented in a different way by assuming $c=1$ and $d = r^2$.
It then says we can represent $x y$ as $Y Z$ satisfying $r\cdot y = \frac ...
- 11
2
votes
2
answers
336
views
Knowing interval of discrete log for elliptic curve
Are there any special attacks I can apply if I know the upper bound for $n$ (meaning $0 \le n \le \text{Upper Bound}$) in the equation $Q = nP$, where $P$ is the base point and I'm trying to solve for ...
- 21
4
votes
1
answer
2k
views
Pollard's Lambda algorithm ecdlp with Pohlig Hellman
I'm trying to solve the ECDLP problem given an elliptic curve defined over a prime field. This prime is large (about 256 bits).
I managed to factor the order of the curve, and most of the prime ...
- 41
6
votes
0
answers
299
views
Index calculus over elliptic curve over function field
According to my understanding there are some pretty solid seeming roadblocks to carrying out an index calculus on an elliptic curve over a finite field. The general strategy is to take points over $E(\...
- 111
9
votes
2
answers
3k
views
ECC algorithm pollard's $\rho$ complexity
One of the methods to break a ECDLP is Pollard's rho algorithm. When ECDLP is defined over a finite field $F_p$, and given a relation $S=w.T$, where S and T are a member of $F_p$. Then ECDLP is to ...
- 2,025