611 reputation
46
bio website
location Brooklyn, NY
age 33
visits member for 2 years, 6 months
seen Jul 8 at 5:53
Good Morning how are you, I'm dr jimbob
I'm interested in things.
I'm not a real dr,
But I am a real jim bob.

Have a PhD in Experimental High-Energy Physics, but left academia in mid-2010 to program professionally.

Mostly program/script in python, django, and jquery these days doing mostly web apps.

Also have experience programming in C, C++, java, haskell, php, and (bash) shell more in the past.

Linux as primary OS since 1999, ubuntu user since 2005 (Hoary).


Jul
8
awarded  Good Answer
May
16
answered Why do “nothing up my sleeve numbers” have low entropy?
Apr
30
awarded  Citizen Patrol
Apr
28
revised x509 CA trust question
added 37 characters in body
Apr
28
answered x509 CA trust question
Jan
28
awarded  Yearling
Sep
25
awarded  Enlightened
Sep
20
comment What is the lowest level of mathematics required in order to understand how encryption algorithms work?
Yes, XOR is minimal (but does it provide a "good understanding" of encryption?). The perfect security of OTP doesn't matter in practice, since OTP requires securely storing a key that's the same size as the text (and only using it once) so its rarely used in practice (why not just store the text securely)? But the math I mentioned doesn't require devoting your whole life to it; learning modular arithmetic to understand RSA takes a few days at most if you take the time to digest each part and play around with toy examples. Yes, there's much more to learn after that, but its easy to start.
Sep
20
awarded  Nice Answer
Sep
20
awarded  Informed
Sep
19
answered What is the lowest level of mathematics required in order to understand how encryption algorithms work?
Jun
9
comment Is every output of a hash function possible?
@fgrieu - No its demonstratable. H(m) maps {0,1}^infinity to {0,1}^N for an N-bit hash function. So, H(H(m)) at the outer function call takes {0,1}^N as input and maps it to {0,1}^N. Thus if we assume one single collision exists (which we expect with overwhelming probability for any hash function -- they intend to attack as random oracles not as permutations), then by the pigeonhole principle the whole output space is not reachable.
Apr
22
comment LT codes with Homomorphic hashing
@makerofthings7 ⊕ is one customary way of writing xor (exclusive or).
Jan
28
awarded  Yearling
Jun
16
awarded  Supporter
Jun
16
answered Toy cipher — does it have a name?
Mar
8
answered Do parts of a hash carry the properties of the entire hash?
Feb
2
revised Can I construct a zero-knowledge proof that I solved a Project Euler problem?
added 325 characters in body
Feb
2
revised Can I construct a zero-knowledge proof that I solved a Project Euler problem?
added 23 characters in body
Jan
28
awarded  Editor