478 reputation
410
bio website twitter.com/orokusaki
location Jupiter, FL
age
visits member for 4 years, 7 months
seen Jul 8 at 3:01

I'm Michael Angeletti. I am a Python / Django developer, specializing in SaaS applications.


Jun
18
awarded  Yearling
Jun
17
awarded  Notable Question
Jun
16
revised Why can't I MitM a Diffie-Hellman key exchange?
edited body
Jun
16
awarded  Good Question
Jun
16
awarded  Popular Question
Jun
16
awarded  Nice Question
Jun
16
awarded  Yearling
Jun
16
accepted Why can't I MitM a Diffie-Hellman key exchange?
Jun
15
revised Securing the security guy's home office: what should we do?
updated to fix logic error, keepin in real
Jun
15
revised Why can't I MitM a Diffie-Hellman key exchange?
deleted 100 characters in body
Jun
15
asked Why can't I MitM a Diffie-Hellman key exchange?
Sep
24
awarded  Autobiographer
Jun
28
comment Why are hash functions one way? If I know the algorithm, why can't I calculate the input from it?
What a very frustrating set of answers to come across. The answer is simple: each hash can be the result of an infinite number of strings being hashed, so there is no way of knowing which one a hash was meant to represent - even more simply put, a hash doesn't represent any one value.
Jun
28
comment Why are hash functions one way? If I know the algorithm, why can't I calculate the input from it?
This isn't "one aspect of the problem". It's the entire answer. This is the most frustrating question I've ever come across, because every one of the answers are wrong, except for yours. I didn't read your entire answer only the first paragraph, which answers everything.
Oct
20
answered Isn't all security “through obscurity”?
Oct
20
comment Isn't all security “through obscurity”?
How can you "measure" the mathematical probability of a "secret" becoming an "obscurity", especially in the age of highly experimental (e.g. quantum) computers. At some point, your 128bit key might be quicker cracked than the port on which your "here's my password" service runs can be guessed (since each network connection might take longer to make than the processing time required to break your key). Just because that's probably not true today does not place your idea of a "secret" squarely into a different class than what you call "obscurity". They are both exactly in the same continuum.
Jul
26
awarded  Critic
Jul
26
comment If a MITM has your public key and you are SSH-ing through the MITM, what is the maximum attack it can perpetrate?
Could you look at my last comment to @apsillers on the original question. I don't think this answers my question or resolves the concern, still.
Jul
26
comment If a MITM has your public key and you are SSH-ing through the MITM, what is the maximum attack it can perpetrate?
@apsillers - ugh... I just realized, I wasn't thinking backwards. I keep my private key on my notebook and put my public key on my server (in ~/.ssh/authorized_keys to allow me to SSH from my notebook to my server. This is precisely the scenario I was concerned with, connecting to a server out there that is actually a MITM pretending to be my server (also having the public key of course).
Jul
26
comment If a MITM has your public key and you are SSH-ing through the MITM, what is the maximum attack it can perpetrate?
Ah, thanks man. This is the light bulb moment I was looking for. Despite my having originally flip-flopped the public/private situation in my head, I was still left with some confusion, especially after having conflated the issue of CAs and then plain ol' PKI via something like SSH.