misterrobot

5 ms·

1.
by misterrobot 9y ago
Hm, ok. Would it have been OK if I hadn't posted it under "Ask HN"? Surely this site supports sharing opinions like this one in some contexts -- it's not like this was a political shitpost or something. Right?
2.
by misterrobot 9y ago
But, perhaps more relevant, the post doesn't say "flagged" on my end (which I'm pretty sure they do when they're flagged).
3.
by misterrobot 9y ago
You're kind of right. At the same time, the comments appear to be answering the question, so...
4.
by misterrobot 9y ago
Weird, this post appears to have been nuked from orbit. What happened?
5.
by misterrobot 9y ago
Because when you host it yourself, it can be off of the public internet.
6.
Ask HN: If your company cares about security, why does it use Slack?
39 points by misterrobot 9y ago|69 comments
7.
by misterrobot 10y ago
XSS is the most common bug on the internet, and there is nothing interesting or novel about this that warrants an article in my opinion. My problem is that this article makes people scared in a way that I do not think is productive. Kudos t
8.
by misterrobot 10y ago
Yeah, this is literally just stored XSS. The fact that they don't even mention XSS in the article just amplifies its click-baitiness.
9.
by misterrobot 10y ago
LOL, these are literally just XSS attacks, the sky is not falling. This is such clickbait. Posts like this make the security community look bad IMO. Report it and move on.
10.
by misterrobot 10y ago
"Division" i.e. multiplying by the multiplicative inverse doesn't require the modulus be prime; it just requires that the number you are finding the inverse of and the modulus are relatively prime.
11.
by misterrobot 10y ago
I'd highly recommend this talk [0] which discusses the practical security issues with such a system. Estonia did something like this. One interesting problem is that of deniability; in order to ensure that voters are not coerced, it is
12.
by misterrobot 10y ago
Please don't apologize, this is an excellent paper! In retrospect I feel a little bad for nitpicking, honestly -- it's a really fascinating read :)
13.
by misterrobot 10y ago
That's not what I'm saying. I'm saying that if factoring were NP hard, by extension a quantum computer could solve NP complete problems in polynomial time (since every problem in NP is reducible to every NP hard problem, by d
14.
by misterrobot 10y ago
Not to mention that being an NP hard problem wouldn't be a strong enough property to ensure the average-case was hard, so I don't think the "considered" saves this from being incorrect...
15.
by misterrobot 10y ago
"Although RSA factorization is considered to be an NP- hard problem if keys that fulfil the above conditions are used..." Isn't this incorrect? The implication would be that quantum computers could solve NP-Complete problems
16.
by misterrobot 10y ago
Also, it can conveniently turn your run-of-the-mill XSS bug into remote code execution! Welcome to 2016, everybody.
17.
by misterrobot 10y ago
It wasn't salted, but even then a targeted effort could almost certainly crack a password as bad as dadada almost immediately for a fast hash like sha1.
18.
by misterrobot 11y ago
Nope. For general search operations (modeling your 128-bit cipher as a black box) the best we know how to do is Grover's algorithm, which gives you a quadratic speed up. Your 128 bit problem is now a 64 bit problem (which is of course
19.
by misterrobot 11y ago
If you have the ability to intern at Palantir you have the ability to intern at any number of more responsible companies. Palantir has a bigger booth at the career fair, but I'd bet working at Apple or Uber is just as much of a resume
20.
by misterrobot 11y ago
The worst part about Palantir is their ability to masquerade as this hip startup, as though working for them is as innocent as working for Imgur or Twitter or whatever. They recruit the hell out of MIT students, and it sucks seeing my frien