
Fascists eating their own is my favorite type of schadenfreude

Fascists eating their own is my favorite type of schadenfreude

It makes sense when you realize that Corporations are first class citizens

I kinda miss ordering a double quarter pounder big mac, but otherwise not worth it for many reasons

I’d probably phrase it more like

I think the closest comparison to what it would be best for is basically air cavalry. Dive in at high speed for a devastating hit-and-run, and then do it again

If you want to be pedantic, fine. Integer factoring is not in P. Therefore the math used to encrypt RSA is not in P. The usage of integer factoring to encrypt therefore means it can’t be decrypted in P using brute force. That’s the point I’m making.

I’m not about to get into the weeds about P vs NP to explain a concept to someone that doesn’t know much about encryption in the first place. I’m aware that factoring isn’t really NP complete, but P vs NP is about solving vs verifying solutions for something in Polynomial time, which can’t be done via brute force for RSA keys.

I know that AES is symmetrical. I was using it to illustrate that symmetrical and asymmetrical encryption have tradeoffs that cannot be worked around.

Well, as they say the S in IoT is for security

Elliptical curve for RSA was immediately phased out as soon as it was proven that the NIST was influenced by the NSA to implement it

There are tradeoffs with encryption. RSA is so secure, that the US government has tried to insert a mathematic backdoor into the key selection because that’s the easiest method to attack the encryption. RSA uses thousands of bits for their encryption, making it inefficient for most attacks. The attack detailed in this article is on one of the weaker RSA algorithms, with only 1024 bits. The high end RSA uses 4096 bits or more, I believe the algorithm has increased the bit length to officially support 8192.
On the other side of RSA is another secure algorithm called AES. It can go up to 512 bits, but it hashes the key to meet the key length instead of relying on generating huge prime numbers. It makes it more resilient to certain types of attacks, but the bit limitation makes it easier to brute force or use rainbow tables.

RSA is secure because it relies on P vs NP. Very basically, RSA multiplies 2 very large prime numbers together to encrypt things. We rely on something similar for secure Internet connections
We’re so back. Can’t wait to see a new influx of community maps!
Perhaps we can ask it to play dwarf fortress and dig down to the Super Happy Fun Stuff