« first day (3416 days earlier)      last day (1265 days later) » 

8:52 AM
@Hristmar I came from computer science, although in Israel CS undergrads do quite a bit of math. I guess it really depends what you mean by CS. If you did a CS degree including theory, then you will be fine. In fact, I think that mathematicians who haven't done CS have a much harder time doing crypto than the other way around. You probably won't do the deep mathematical parts of crypto and you'll probably feel inadequate about them. The reason I am saying that is that I'm exactly the same.
@Hristmar (continued) With basic discrete math and probability, basic combinatorics, and basic number theory, you'll be fine. I don't have anything beyond that, and although I'm far from the strongest mathematically, I am able to contribute to the research community. Best of luck!
2
 
 
6 hours later…
2:50 PM
0
Q: Allow Crypto.stackexchange.com to offer a basic peer review functionality?

cavemanI know that it is possible to ask specific questions about cryptography in this site, and that generic questions are discouraged as it is not clear how to answer them (effectively general questions become a form of vandalism where time is wasted without any value gains to humanity). However, I st...

 
3:08 PM
@Maeher How long does it usually take you to peer-review a new paper?
Is ~1h on the shorter end of that spectrum?
 
I don't think I've ever managed to review a paper that wasn't an obvious crackpot paper in an hour.
 
3:45 PM
Huh, I guess I answered a homework question without realizing.
0
Q: PRG exponential expansion

xor_zeroI am just beginning to read into pseudorandom generators and I came across this definition for a PRG: $G_n : \{0,1\}^n \rightarrow \{0,1\}^{l(n)}, \quad \text{ where $l(n)$ is a polynomial}$ Is there a reason why $l(n)$ has to be polynomial? Wouldn't there be an even better security guarantee if ...

seemed like a fairly genuine question from someone first coming into contact with the definition.
Then this showed up:
0
Q: Showing that there is no such pseudorandom generator

user84987I want to prove that there is no pseudorandom generator $G_n:\{0,1\}^n \rightarrow \{0,1\}^{2^n}$

Which is probably a much less well disguised version of the same homework question.
 
 
3 hours later…
6:43 PM
@Maeher yes, that is clever.
 
 
1 hour later…
8:01 PM
Answered then deleted!
 

« first day (3416 days earlier)      last day (1265 days later) »