Reputation
1,490
Top tag
Next privilege 1,500 Rep.
Approve tag wiki edits
Badges
1 9 22
Newest
 Caucus
Impact
~71k people reached

Mar
31
asked Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
Mar
3
awarded  Famous Question
Feb
26
revised Are there any asymmetric composite order group bilinear pairings?
added 37 characters in body
Feb
26
asked Are there any asymmetric composite order group bilinear pairings?
Jan
26
awarded  Tumbleweed
Jan
19
asked Differential Privacy and appropriate noise distribution
Dec
28
comment Why is proof-by-reduction needed (for Elgamal proof of security, for example)?
@Maeher i can't get how you start building your distinguisher since you state:compute x. In order to compute x you break DL, which is impossible for computationally bounded adversary.
Dec
18
awarded  Popular Question
Dec
15
accepted What is the difference between uniformly and at random in crypto definitions?
Dec
15
asked What is the difference between uniformly and at random in crypto definitions?
Dec
10
revised Proving the semantic security of the One Time pad
edited body
Dec
10
revised Proving the semantic security of the One Time pad
deleted 4 characters in body
Dec
10
revised Proving the semantic security of the One Time pad
added 32 characters in body
Dec
10
revised Proving the semantic security of the One Time pad
added 3 characters in body
Dec
10
revised Proving the semantic security of the One Time pad
added 1850 characters in body
Dec
10
comment Proving the semantic security of the One Time pad
There is.I edit my answer
Dec
10
revised Proving the semantic security of the One Time pad
added 1850 characters in body
Dec
10
answered Proving the semantic security of the One Time pad
Nov
29
awarded  Popular Question
Nov
29
answered Where can I begin to study the math behind modern cryptography?