Reputation
1,515
Top tag
Next privilege 2,000 Rep.
Access moderator tools
Badges
2 9 23
Impact
~74k people reached

Apr
1
comment Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
Does this imply that finding inverses mod $N=pq$ is also hard as long you don't know the factorization of $N$
Mar
31
comment Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
The adversary knows $N^2$, so i guess it is not hard to learn the inverse of $u$ with the extended Euclidean.
Mar
31
comment Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
Yes but my concern is that i want the inverse not moduli $\phi(N^2)$ but $(N^2)$
Mar
31
comment Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
The solution to the RSA problem as you said is the inverse of $e$ moduli $\phi(N)=(p-1)(q-1)$. And it is believed that if the factorization $(p,q)$ is not known you cannot find the inverse.
Mar
31
comment Is computing roots moduli a composite $N$ a hard problem without knowing the factorization of $N$?
RSA problem states that it is difficult to compute multiplicative inverses moduli $\phi(N)$
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
10
comment Proving the semantic security of the One Time pad
There is.I edit my answer
Nov
10
comment Best group if one wants the discrete log problem to be hard?
@RickyDemer why #2 is easy?
Oct
20
comment problem with “one time pad”
What do you mean if you have the same message the same message is encrypted?
Oct
16
comment Does the following linear equation hold in bilinear pairings?
Maybe it was not clearly defined but the setup is for any randomly chosen $a_1,a_2$ and $x_1,x_2$
Oct
15
comment Database row level encryption scheme
What is the number of particles in the universe
Sep
11
comment What exactly is a negligible (and non-negligible) function?
Numerically what is negligible nowdays? $2^{-80},2^{-70},?$ And can this be justified with existing computational power?
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
Paillier cryptosystem is also randomized. It is additively homomorphic. EAch time the same message is encrypted in different ciphertexts. However the decryption is deterministic... That's why encryption algorithms are described as randomized processes and decryption as deterministic. The former it's for security while the latter it's for correctness
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
@pAkY88 Well since you are thinking of not decrypting then it seems that you are looking for a homomorhpic hash-tag like primitive...
Aug
12
comment linear computations over bilinear pairings
Thank you. Very illustrative answer!
Aug
12
comment linear computations over bilinear pairings
if $x_2=g_2^{r_1}$ and $x_4=g_2^{r_2}$ does anything change for $r_1, r_2 \in \mathbb{Z}_p$
Aug
12
comment linear computations over bilinear pairings
It's not very clear to me what does it mean for $e(x_1,x_4)$ and $e(x_2,x_3)$ to be opposite...
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
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