|
Soon google will have complete control over the cyberwebs
|
#
?
Mar 3, 2021 11:12
|
|
|
|
| # ? Apr 19, 2024 23:14 |
|
|
If the author's had actually discovered one weird trick to destroy the RSa cryptosystem then they could just prove it, just give a single example. What they did instead is copied someone's rambling manifesto and replaced 'timecube' with the integral symbol and 'New World Order' with matrix math
|
|
#
?
Mar 3, 2021 13:27
|
|
|
Dude is legit tho it seems someone took an older paper and added the "this killes the crab" comment to it for some reason
|
|
#
?
Mar 3, 2021 14:11
|
|
|
imagine four primes on the edge of a cliff. when one falls over, another takes its place. cryptography works the same way
|
|
#
?
Mar 3, 2021 15:02
|
|
|
Only trouble ever comes out of math departments. Nothing good has ever happened there
|
|
#
?
Mar 3, 2021 15:06
|
|
|
The internet is like a tube. Hackers and nasa have tapped the tube before it gets to you, and they have their lips wrapped around a pipe trying to suck out all your data. You need to suck on the tube harder than they can, so your poo poo goes your way and not up their pipe. That's cryptography.
|
|
#
?
Mar 3, 2021 15:13
|
|
|
human garbage bag posted:If they broke RSA then they could easily demonstrate it by posting the private key of a random public key found online. Since they didn't it's at most an improvement over the existing best polynomial time algorithm.
|
|
#
?
Mar 3, 2021 15:20
|
|
|
i'll show you my p group
|
|
#
?
Mar 3, 2021 15:25
|
|
|
gary oldmans diary posted:it doesnt seem like you would prove all p=np by moving an np problem into the p group And it isn't known exactly which complexity class integer factorization falls into anyway
|
|
#
?
Mar 3, 2021 15:48
|
|
|
gary oldmans diary posted:it doesnt seem like you would prove all p=np by moving an np problem into the p group P = NP if you have a polynomial time solution for any NP-complete problem, but solving any other problem in NP in polynomial time doesn't buy you much. Integer factorization is not known to be NP-complete, and a lot of people would be very surprised if that turns out to be the case. We'd also be surprised but less so if it turned out to have a polynomial time solution.
|
|
#
?
Mar 3, 2021 15:51
|
|
|
Quantum computing breaks all encryptions https://www.youtube.com/watch?v=I3BJVaioX_k That guy above says it might be possible to use some kind of geometrical algorithm that makes calculations in 500 dimensions or something, which I'm guessing will make it so you could have huge numbers of "correct" decryptions, but most of those results will just be noise... (?)
|
|
#
?
Mar 3, 2021 15:53
|
|
|
Symmetric key cryptography is still considered to be safe from quantum computers.
|
|
#
?
Mar 3, 2021 16:03
|
|
|
does this meant the wu-tang clan is gonna split up?
|
|
#
?
Mar 3, 2021 16:14
|
|
|
what's the point of security anyway if dolores from HR is using the password mittens123 and every stupid place you ever put your social security number ever has been breached three times over
|
|
#
?
Mar 3, 2021 16:15
|
|
|
low key sex master posted:I've read this post top to bottom like five times and have absolutely no idea what the hell it's about Yeah I'm here with you in the "wtf is this" camp
|
|
#
?
Mar 3, 2021 17:05
|
|
|
low key sex master posted:I've read this post top to bottom like five times and have absolutely no idea what the hell it's about A lot of what happens on the internet only works if three conditions are met:
However, it's been known for a while that RSA would eventually be broken by quantum computers, so people have been working on a replacement for a long time. I don't know how widely used anything else is, but it's only a matter of time before RSA is replaced. Also, no discussion of encryption is complete without one of the few good xkcd comics: 
|
|
#
?
Mar 3, 2021 17:28
|
|
|
|
| # ? Apr 19, 2024 23:14 |
|
|
https://twitter.com/inf_0_/status/1367376526300172288 We good.
|
|
#
?
Mar 6, 2021 01:05
|
|