1,073 reputation
614
bio website
location
age
visits member for 2 years, 8 months
seen 39 mins ago

Dec
24
comment Difference between computational and statistical indistinguishabilities
Also statistical indistinguishability is stronger than computational indistinguishability as there is not restriction on the computational power. So it might be the case that a scheme preserves computational indistinguishability but not the statistical indistinguishability
Dec
19
comment Are those two distributions indistinguishable?
$f(x)$ is defined $mod N^2$ as well
Dec
19
revised Are those two distributions indistinguishable?
added 6 characters in body
Dec
19
comment Are those two distributions indistinguishable?
I don't understand your comment. you are given 1 number. Either in the first form or in the other form and you have to decide whether or not there exist a quadratic residue for this number.
Dec
19
asked Are those two distributions indistinguishable?
Dec
17
comment How does OAEP improve the security of RSA?
How the legal receiver gets rid of the pad if he doesn't know the $r$? It just spits the $#pad$ bytes? That implied a public knowledge of the pad length.
Dec
16
revised Advantages of bilinear map
added 1 characters in body
Dec
16
comment Advantages of bilinear map
Maybe i should rephrase: "The first use of pairing that we know is not for construction of cryptographic primitives but to break some hard assumptions as the DL in specific groups"
Dec
16
answered Advantages of bilinear map
Dec
14
awarded  Popular Question
Dec
11
awarded  Notable Question
Dec
7
comment How do I calculate the private key in RSA?
These are standard techniques you can find in all books.We say the same thing.In order to compute the inverse you can use the extended euclidean algorithm
Dec
6
revised How do I calculate the private key in RSA?
added 1 characters in body
Dec
6
answered How do I calculate the private key in RSA?
Dec
6
comment Why the following attack in common modulus RSA works?
You said that even if we do not know $\lambda(N)$ we can learn $k \lambda(N)$ which is true. But then how you apply the $mod(\lambda(N))$ operation?
Dec
5
reviewed Approve suggested edit on Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
Dec
5
revised Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
added 17 characters in body
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
sorry i assume there are always positive.
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
I assume that x,y are always smaller than the modulo
Dec
5
comment Modulus for elliptic curve point multiplication
@CodesInChaos I thought we always think for polynomial interpretations in finite fields (?)