2,852 reputation
1022
bio website
location
age
visits member for 3 years, 3 months
seen yesterday

Jun
19
comment Parallelized Pollard's Rho algorithm for ECDLP + Jacobian coordinates
That should work (modulo a few unlikely corner cases). But keep in mind that will still be slower than affine with batch inversions; for a large enough batch, an inversion costs 3 multiplications, and affine coordinates look much better performance-wise than Jacobian, even assuming the DP check is free.
Jun
19
answered Parallelized Pollard's Rho algorithm for ECDLP + Jacobian coordinates
Jun
19
answered Fast hashing into elliptic curve
Jun
15
revised curve25519 weak points for contributory behaviour
added 5 characters in body
Jun
15
answered curve25519 weak points for contributory behaviour
May
11
awarded  Custodian
May
11
awarded  Custodian
May
11
reviewed No Action Needed Hash collision resistance of $\mathcal H^\prime(m) = \mathcal H(\mathcal H(m)|m)$
May
7
awarded  Nice Answer
May
6
answered Is knowing the private key of RSA equivalent to the factorization of $N$?
Mar
29
reviewed Approve suggested edit on Is it possible to weaken a bitcoin private key by “using” it elsewhere?
Feb
19
reviewed Approve suggested edit on Can we ensure the security of a crypto-algorithm and -implementaton against acoustic cryptanalysis?
Feb
11
awarded  Citizen Patrol
Feb
9
revised Safe elliptic curve point addition using projective coordinates: How do I tell if the points are the same?
added 58 characters in body
Feb
9
answered Safe elliptic curve point addition using projective coordinates: How do I tell if the points are the same?
Jan
19
answered Why is this authentication procedure using Rabin crypto not useful?
Jan
15
awarded  Announcer
Jan
13
comment Is there a feasible method by which NIST ECC curves over prime fields could be intentionally rigged?
The only thing that comes close to what you are asking is Edlyn Teske's isogeny trick, mentioned in the other question. Apart from that, there is only speculation about unknown weaknesses.
Jan
13
comment Time complexity to solve Discrete log problem
You're right, of course. Given it's little-oh, that factor can actually be any function, as long as it becomes insignificant at infinity input sizes.
Jan
13
revised Time complexity to solve Discrete log problem
added 7 characters in body