883 reputation
920
bio website ce.sharif.edu/~dousti
location Tehran, Iran
age 30
visits member for 4 years
seen Sep 30 at 22:32

I'm a Ph.D. candidate, studying computer science. My research interests include Foundations of Cryptography and Computational Complexity Theory.

My Ph.D. thesis title is "Conceptual Analysis and Improvement of Zero-Knowledge Models."


Oct
11
awarded  Yearling
Jul
2
awarded  Curious
May
24
answered what is the relationship between the complexity class E(and EXP) and NP?
May
7
awarded  Notable Question
Feb
16
awarded  Good Question
Feb
8
comment How to solve equations of type $x^x = k \pmod{n}$
@Benh: That was a fascinating observation! But the problem requires $x < n$.
Feb
8
comment How to solve equations of type $x^x = k \pmod{n}$
@GerryMyerson: Is it possible to establish an evidence for the hardness of this problem?
Feb
8
asked How to solve equations of type $x^x = k \pmod{n}$
Nov
16
awarded  Popular Question
Nov
3
awarded  Nice Question
Oct
11
awarded  Yearling
Sep
23
asked A tight lower bound for the entropy of the XOR of two random variables
Sep
8
awarded  Popular Question
Aug
27
accepted A simpler proof for an equality regarding sums of absolute values
Aug
26
asked A simpler proof for an equality regarding sums of absolute values
Aug
19
comment Understanding notation difference between mutual information and information divergance
+1 for the last sentence: "Because even scientists cannot be as exact and internally consistent (at least in terminology) as science demands." :D
Aug
13
asked Joint distribution between a uniform random variable and a function which is “almost” independent from it
Jul
31
accepted Does “short integer solution” lattice problem admit hard instances with q=2?
Jul
31
answered Does “short integer solution” lattice problem admit hard instances with q=2?
Jul
31
revised Why the following observations regarding lattices hold?
added 405 characters in body