Reputation
3,707
Top tag
Next privilege 4,000 Rep.
Access 'trusted user' tools
Badges
12 26
Newest
 Enlightened
Impact
~44k people reached

  • 0 posts edited
  • 2 helpful flags
  • 551 votes cast
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 Is it possible to weaken a bitcoin private key by “using” it elsewhere?
Feb
19
reviewed Approve 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
Jan
13
answered Time complexity to solve Discrete log problem
Dec
27
awarded  Nice Answer
Dec
26
awarded  Custodian
Dec
26
reviewed Approve
Dec
26
reviewed Approve
Dec
26
revised Why are the lower 3 bits of curve25519/ed25519 secret keys cleared during creation?
deleted 14 characters in body