Reputation
347
Top tag
Next privilege 500 Rep.
Access review queues
Badges
3 6
Impact
~13k people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Sep
30
answered How robust is discrete logarithm in $GF(2^n)$?
Sep
29
comment Can ECDSA signatures be safely made “deterministic”?
Can you give a reference for a technique which would exploit such weak partial information on k? I think I recall seeing an attack which required several bits fixed.
Sep
29
comment Can ECDSA signatures be safely made “deterministic”?
What a coincidence that you're the author of the relevant RFC! It's "expired" - what happened to it? You make a good point about wanting not to have to worry about detecting bad quality random numbers.
Sep
29
comment Can ECDSA signatures be safely made “deterministic”?
Thanks for the references. The EdDSA paper refers to setting k as the hash of the message and private key which for many applications would be faster and superior to my original proposal.
Sep
29
awarded  Student
Sep
29
asked Can ECDSA signatures be safely made “deterministic”?