When will the internet be unsafe?

Post Reply New Topic

What the hell, why did someone go and come up with a math problem that would cause 'loss of the internet' I mean gee probably only a matter of time before someone solves it.....though I am confused on how getting the answer to a math problem would end the internet, how will the internet know if someone solves it?

...how would you like it if the NSA took samples of your urine and see what liquids you drink to see if they are the same as the liquids terrorists drink, most people would consider that a violation of privacy.

Actually, the Reimann hypothesis is one of the most famous and difficult problems in Mathematics. At least 1 million dollars would be awarded to anyone genius who can solve it. It would be an EPIC accomplishment.

aka the 'internet' would know

I don't think I would like being bothered with providing samples, but I wouldn't mind if they operated silently downstream without clogging up the toilet or interrupting the water supply. Digital sewer work is important, and it is indeed true: If you've got nothing to hide, you've got nothing to fear.

People suffering from melissophobia are often found hiding in honeypots.

...melissophobes are usually far from honeypots.

The internet won't know, that's ridiculous.

This math problem was made in 1859 by Bernhard Riemann. It's not an answer, some one has to prove a theorem for infinitely many cases meaning that you can't just check every one. People have checked billions of cases and it's true but there are still infinitely many more to go.

I'll explain what encryption is based on, it is based on the factorization of large prime numbers. You see prime factorization cannot be solved "fast" by a computer, it takes many years when numbers are very large and that's what encryption is based on. The Riemann Hypothesis will find a efficient algorithm to factorize large numbers.

If you are not following, perhaps a certain theorem will help. All non-prime positive integers can be expressed as the product of primes. 20=4x5=2x2x5 2 and 5 are both prime. 30=5x6=5x3x2 5,3,2 are all prime. It takes a computer a long time to find the prime factors of a large positive integer. So encryption is based on the prime factorization of large numbers which will take a computer many years to crack. There is actually another problem based on this called P vs NP. P means polynomial time, NP means non-polynomial time. Multiplication and basic operations such as logarithms, multiplication, exponents take a computer relatively fast to solve therefore P . While factorization is NP because it takes a long time to solve. The P vs NP conjecture asks if all NP problems can be solved fast. The RH being true implies factorization has a P class algorithm

The Riemann Hypothesis is a theorem, someone asked the question, it's not necessarily true.

Not true.

Your computer can be hacked easily if unencrypted. In Windows and Mac the passwords are stored in a file, boot a Linux Live CD and copy the file to a storage device and you got your passwords.

Also a hacking OS called ophcrack is so simple you just boot it up and you can crack passwords, extremely simple. So imagine if someone was running a Windows server...

Full disk encryption also helps prevent ransomware attacks such as CryptoLocker (a virus that encrypted all of your files and gave you the password when you paid them $500), there is no such thing as to much security.

I remember seeing something similar on Reddit today (I just joined to talk about autism, computers and mathematics however it focuses more on "fun" discussions rather than problems unlike Math SE) there was a thread asking if you aren't a child porn viewer why would you need to use full disk encryption? It makes your computer more secure, unable to be hacked by even security agencies. It's like people saying "if you use a VPN you must be a criminal" that pisses me off. What if you are in a public Wi-Fi network no encryption key or password, anyone could see what you are on, if you use a VPN, that's not the case.

People that say things like that really annoy.

Also, some people's comments regarding the NSA are "if you don't have anything to hide, why should you be worried?". Well, how would you like it if the NSA took samples of your urine and see what liquids you drink to see if they are the same as the liquids terrorists drink, most people would consider that a violation of privacy. The spying kerfuffle with the NSA and the GCHQ is basically the same.

If you've got nothing to hide, you've got nothing to fear.

People suffering from melissophobia are often found hiding in honeypots.

...you don't believe in government corruption, systematic abuse of certain segments of the population?

I was kind of joking...I don't get math at all really, and I know the internet doesn't actually 'know' things. But basically are you saying this theorem if solved would give whoever solves it the knowledge/means to screw up the encryption which would then cause problems with the internet or something to that effect?

I'll explain what encryption is based on, it is based on the factorization of large prime numbers. You see prime factorization cannot be solved "fast" by a computer, it takes many years when numbers are very large and that's what encryption is based on. The Riemann Hypothesis will find a efficient algorithm to factorize large numbers.

If you are not following, perhaps a certain theorem will help. All non-prime positive integers can be expressed as the product of primes. 20=4x5=2x2x5 2 and 5 are both prime. 30=5x6=5x3x2 5,3,2 are all prime. It takes a computer a long time to find the prime factors of a large positive integer. So encryption is based on the prime factorization of large numbers which will take a computer many years to crack.

The Riemann Hypothesis is a theorem, someone asked the question, it's not necessarily true.

The internet is not based on encryption. It is based on a communications protocol that provides for packet switching across the network.

Encryption is a problem, trust is a problem, but neither of those problems is the internet.