Viewing profile — misterrobot

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 …

But, perhaps more relevant, the post doesn't say "flagged" on my end (which I'm pretty sure they do when they're flagged).

You're kind of right. At the same time, the comments appear to be answering the question, so...

Weird, this post appears to have been nuked from orbit. What happened?

Because when you host it yourself, it can be off of the public internet.

It's insane to me how many "security conscious" companies use Slack purely out of convenience. The fact is, it's an enormous, centralized application written in PHP (not always a b…

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 peopl…

Yeah, this is literally just stored XSS. The fact that they don't even mention XSS in the article just amplifies its click-baitiness.

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.

"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 …

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…

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 :)

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 N…

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 incor…

"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 quantu…

Yeah, but then I'd have to stop putting ASCII art of my genitals in my comments. Ugh.

Also, it can conveniently turn your run-of-the-mill XSS bug into remote code execution! Welcome to 2016, everybody.

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.

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 b…

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 be…

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 recrui…