Reputation
203
Top tag
Next privilege 250 Rep.
View close votes
Badges
1 7
Newest
 Yearling
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 5 votes cast
Dec
5
comment Non-Interactive Zero-Knowledge-Proof for discret Logarithm?
sorry, i mean the prover has the value of the discrete logarithm $x$, and he want to convenes the verifier that he knows the value of $x$ without giving the verifier this value ..
Dec
5
asked Non-Interactive Zero-Knowledge-Proof for discret Logarithm?
Nov
14
awarded  Teacher
Nov
14
answered Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us
Nov
12
awarded  Scholar
Nov
12
accepted Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us
Nov
12
comment Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us
okay, thank you very very much
Nov
12
awarded  Editor
Nov
12
revised Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us
edited tags; edited title
Nov
12
asked Breaking RSA, given a special kind of oracle that decrypts related ciphertexts for us