1,083 reputation
614
bio website
location
age
visits member for 2 years, 8 months
seen 1 hour ago

Jul
17
revised pairing-based schemes
edited body
Jul
17
comment Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
Sorry for my unclear comment. It's is its and refers to the inverse of $b$ mod (p-1). Is $p$ unknown?
Jul
17
comment Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
I guess in $\mathbb{Z}_p$ after finding it's inverse
Jul
17
answered Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
Jul
13
answered pairing-based schemes
Jul
8
reviewed Approve suggested edit on Is either brainpoolP320r1 or brainpoolP320t1 a SafeCurve?
Jul
2
awarded  Inquisitive
Jul
2
awarded  Curious
Jun
12
awarded  Nice Question
Jun
2
comment Reductionist proofs of decisional problems to computational
This is also another right-up towards this direction cseweb.ucsd.edu/~mihir/papers/gl.pdf
Jun
2
comment Reductionist proofs of decisional problems to computational
Thank you. Very educative and precise analysis
Jun
2
accepted Reductionist proofs of decisional problems to computational
May
31
revised Reductionist proofs of decisional problems to computational
deleted 6 characters in body
May
31
revised Reductionist proofs of decisional problems to computational
added 1155 characters in body
May
30
reviewed Approve suggested edit on Security of the iterated Hill Cipher
May
28
revised Reductionist proofs of decisional problems to computational
added 142 characters in body
May
28
asked Reductionist proofs of decisional problems to computational
May
26
reviewed Approve suggested edit on Quantum key distribution simulation
May
25
reviewed Approve suggested edit on How should I calculate the entropy of a password?
May
25
revised Journals to read in order to keep up to date with interesting research
edited body