Reputation
3,622
Top tag
Next privilege 4,000 Rep.
Access 'trusted user' tools
Badges
11 25
Newest
 Revival
Impact
~43k people reached

  • 0 posts edited
  • 2 helpful flags
  • 550 votes cast
Oct
29
revised Understanding Twist Security with respect to short Weierstrass curves
added 154 characters in body
Oct
29
revised Understanding Twist Security with respect to short Weierstrass curves
added 50 characters in body
Oct
29
revised Understanding Twist Security with respect to short Weierstrass curves
added 223 characters in body
Oct
29
answered Understanding Twist Security with respect to short Weierstrass curves
Oct
7
awarded  Revival
Aug
23
awarded  Enlightened
Aug
23
awarded  Nice Answer
Aug
22
awarded  Yearling
Aug
18
answered SRP-6 vulnerabilities when N is small
Aug
15
comment Subverting the key generation step in RSA public key cryptography
This method subverts the RSA public key in several ways, one of which is by embedding part of the secret prime in the modulus itself. The rest can be recovered in polynomial time.
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$?