116 reputation
4
bio website
location
age
visits member for 5 months
seen May 28 at 15:46

May
2
revised Generating the keys for the RSA cryptosystem in probabilistic polynomial time
added 28 characters in body
May
2
comment Generating the keys for the RSA cryptosystem in probabilistic polynomial time
Yes this is the intuition, but is there a formal proof aof this?
May
2
asked Generating the keys for the RSA cryptosystem in probabilistic polynomial time
Apr
22
awarded  Scholar
Apr
22
accepted Definition of one-way functions: randomly-chosen point vs every point
Apr
21
comment Definition of one-way functions: randomly-chosen point vs every point
I don't ask "for every $x$ there is an algorithm $M$ such that..." I mean simply "$M$ is algorithm such that for every $x$..." To be more precise, FIX the algorithm $M$; now saying that the property $2)$ is true for every $x\in\Sigma^k$ is the same as saying that it is true for $x$ randomly chosen in $\Sigma^k$? Math books generally don't use the phrase "for $x$ randomly chosen...", they simply use the statement "for any $x$ in...". On the other hands computer-science book underline the word "random".
Apr
21
asked Definition of one-way functions: randomly-chosen point vs every point
Apr
20
awarded  Student
Apr
17
revised One time pad: why is it useless in practice?
added 44 characters in body
Apr
17
awarded  Supporter
Apr
17
revised One time pad: why is it useless in practice?
edited title
Apr
17
awarded  Editor
Apr
17
revised One time pad: why is it useless in practice?
added 64 characters in body
Apr
17
asked One time pad: why is it useless in practice?