Reputation
425
Top tag
Next privilege 500 Rep.
Access review queues
Badges
1 6 18
Impact
~34k people reached

  • 0 posts edited
  • 0 helpful flags
  • 72 votes cast
Jul
19
awarded  Popular Question
May
9
awarded  Favorite Question
Apr
23
awarded  Famous Question
Feb
3
accepted Understanding why the public exponent $e$ is chosen the way it is in RSA
Jan
29
comment Understanding why the public exponent $e$ is chosen the way it is in RSA
can you explain why it is wrong for there to be an element in G where $x^r=1$ would there not be such occurances if $r$ was not a multiple?
Jan
29
comment Understanding why the public exponent $e$ is chosen the way it is in RSA
so if $e$ was a factor of $n$, then a multiple of it would produce a mapping from x+1 to 1 using the modulus operator and then it would be known how to find the other multiple and then find the inverse?
Jan
29
comment Understanding why the public exponent $e$ is chosen the way it is in RSA
@Anreas Caranti, could you possibly make it a bit more accessible to a layman? I am unable to work out why $x^r =1$ when $r$ divides $e$.
Jan
28
revised Understanding why the public exponent $e$ is chosen the way it is in RSA
correcting wrong choice of word private/public
Jan
28
comment Understanding why the public exponent $e$ is chosen the way it is in RSA
@mixedmath, could you please expand on this?
Jan
28
revised Understanding why the public exponent $e$ is chosen the way it is in RSA
tag
Jan
28
asked Understanding why the public exponent $e$ is chosen the way it is in RSA
Dec
15
accepted How is percolation defined and measured in social networks?
Sep
16
awarded  Yearling
Jul
2
awarded  Curious
May
14
awarded  Popular Question
Apr
28
awarded  Nice Question
Feb
25
awarded  Popular Question
Oct
3
comment What is the equation for the average path length in a random graph?
@DPoole, sure, that sounds good. The asymptotic distribution for the distance between any two vertices in the network looks close enough to what I am asking. I want to have a prior on the number of steps of a random walker in the network.
Oct
2
asked How to denote the opposite case of the Kronecker Delta?
Sep
30
comment What is the equation for the average path length in a random graph?
@DPoole, yes, this is the uniform basic random graph case, $G(n,m)$, a type of ER graph.