Obviously I am not going to search through hundreds of Slashdot articles because you are posting as AC but I have personally read this little rant at least three times and I'm not even on this site very often.
Cool story bro, but the fact that you keep posting it over and over on tangentially related slashdot articles makes me really think you need some therapy. Let it go.
Cool story bro, except that it is entirely wrong. And you are once again defending the actual, historical Nazis so I'm not engaging with you any more. Kindly fuck off.
But they could just take that same money and put it into public works programs which would actually improve the common good instead of making a foreign country richer, and it would have the same effect on jobs.
I don't know what your point is. As I stated before, the SA came first and they were also funded directly by the Nazi party. It was literally the same exact thing on the other side, but founded earlier and active earlier. So again, tell me how SA was countering anything and not the ones that actually started it?
Why do you keep saying things which are not only historically inaccurate but easily disprovable? The AA was founded ten years after the SA, tell me again how the SA was a counter to it please. Also what are you talking about black shirts? The black shirts were the Italian version of the brown shirts, nothing to do with communists or antifa. Look at historical pictures, they are black and white so you can't see exactly what color they are wearing but it definitely isn't black.
if you want to go on long trips, which most people do
Citation required.
Until then we Americans aren't interested.
You know over 80% of people in the US live in urban areas. Sounds like YOU aren't interested, which is fine because the other 80% of us don't care about you, since you are making it aggressively clear that you don't care about us.
Why are you so defensive about this? If it doesn't work for you then just don't buy it. Do you make it a point at the grocery store to tell them about all the products you don't want to buy?
This is what happened early on during the Wiemar Republic as Hitler's Brown Shirts stated govern the public discourse with violence and coercion.
Just clarifying here, you are using nazi atrocities to justify why we should now be tolerant of nazis?
This is a heavy read. It is a scary read. It reveals how "movements" such as Antifa are doing exactly what the Germans did leading up to the collapse of the Wiemar Republic and WW-II.
If you are so familiar with the rise of the nazi party why are you not freaking out at what is happening right now in the US? If we say, "oh they are a small group of crazy people, just ignore them and they will go away," that is exactly what happened in Germany before the nazis managed to pit everyone against each other and wrest control of the government. What do you think we should do to prevent that from happening here? Because allowing them a platform didn't work very well last time.
There are a lot of things that are possible but so unlikely that they aren't worth talking about. A colony of ants could randomly spell out the encryption key in the dirt but it is so stupidly unlikely that nobody is going to bother making a post about it. Brute forcing a 256-bit encryption key is the same thing.
I mean, it would be roughly the same chances as you buying one lottery ticket and it being the winning one every day of your life for 100 years. So... probably not.
I would say it is at least a little surprising. I can't find anywhere where it is described how the key was obtained, but it is large enough that it couldn't have been brute forced. And, ostensibly, it only exists inside the secure enclave and in Apple's care. A breach in either place would be surprising.
To clarify though, no security was actually broken here. All he did was decrypt an obfuscated portion of the firmware. This may lead to some vulnerabilities in said firmware being discovered, but as of yet iOS is just as secure as it was yesterday.
Oh yes, this is definitely true. We can have the P != NP and cryptography is still impossible. Russel Impaggliazzo calls this possibility Pessiland in his famous five worlds paper.
There also aren't any problems with known upper bounds that are very high, it is either we only know exponential algorithms or we know fairly efficient algorithms. There is no well-known problem that has like a O(n^10) as the best known algorithm.
I used probably in a colloquial sense, like if god came down today and said at midnight he was going to tell us whether factoring is NP-complete I would bet money that it is not. There is no actual probability, it either is or isn't and we just don't know right now. I should have said it would be surprising if it was NP-complete. because that would imply NP = coNP which would be as surprising a result as P = NP.
What word would you use to mean, "looks like it proves this but we really don't know yet because there might be a mistake in it and it will probably take months or years to decide if it is valid"?
That is only because factoring is not known to be (and probably isn't) NP-complete. If this result is true, and NP != P, then we do now know for sure that a large class of problems (NP-complete ones) do not have polynomial time algorithms.
x^100 is polynomial time, but not calculable on nearly on the same scale as x^2 or x^3
It is true that there are problems with lower bounds of every possible polynomial (this follows from the time hierarchy theorem), there don't seem to be naturally occurring ones. I don't think there are any proven non-trivial lower bounds for a natural problem that are greater than n^2. Reductions are the same, most are done with very low polynomial complexity. So if a reduction proof was made that showed P = NP it would likely also lead to reasonably efficient algorithms for all problems in P.
new algorithms that don't rely on non-polynomial time calculations will be available
I'm not sure what you are imagining but this is kind of impossible, or at least not very friendly. If we start making encryption schemes that have only a polynomial separation between algorithms that perform the encryption and algorithms that break the encryption then we allow that expensive supercomputers will always be able to break encryption done by cheap, slow devices. This would be a dream for government surveillance.
Slashdot Mirror
Obviously I am not going to search through hundreds of Slashdot articles because you are posting as AC but I have personally read this little rant at least three times and I'm not even on this site very often.
You might look older but you get to live longer.
Cool story bro, but the fact that you keep posting it over and over on tangentially related slashdot articles makes me really think you need some therapy. Let it go.
You have absolutely no proof, you can't just claim facts and make it true. Sorry.
Cool story bro, except that it is entirely wrong. And you are once again defending the actual, historical Nazis so I'm not engaging with you any more. Kindly fuck off.
But they could just take that same money and put it into public works programs which would actually improve the common good instead of making a foreign country richer, and it would have the same effect on jobs.
https://en.wikipedia.org/wiki/...
I don't know what your point is. As I stated before, the SA came first and they were also funded directly by the Nazi party. It was literally the same exact thing on the other side, but founded earlier and active earlier. So again, tell me how SA was countering anything and not the ones that actually started it?
Why do you keep saying things which are not only historically inaccurate but easily disprovable? The AA was founded ten years after the SA, tell me again how the SA was a counter to it please. Also what are you talking about black shirts? The black shirts were the Italian version of the brown shirts, nothing to do with communists or antifa. Look at historical pictures, they are black and white so you can't see exactly what color they are wearing but it definitely isn't black.
if you want to go on long trips, which most people do
Citation required.
Until then we Americans aren't interested.
You know over 80% of people in the US live in urban areas. Sounds like YOU aren't interested, which is fine because the other 80% of us don't care about you, since you are making it aggressively clear that you don't care about us.
Why are you so defensive about this? If it doesn't work for you then just don't buy it. Do you make it a point at the grocery store to tell them about all the products you don't want to buy?
This is what happened early on during the Wiemar Republic as Hitler's Brown Shirts stated govern the public discourse with violence and coercion.
Just clarifying here, you are using nazi atrocities to justify why we should now be tolerant of nazis?
This is a heavy read. It is a scary read. It reveals how "movements" such as Antifa are doing exactly what the Germans did leading up to the collapse of the Wiemar Republic and WW-II.
If you are so familiar with the rise of the nazi party why are you not freaking out at what is happening right now in the US? If we say, "oh they are a small group of crazy people, just ignore them and they will go away," that is exactly what happened in Germany before the nazis managed to pit everyone against each other and wrest control of the government. What do you think we should do to prevent that from happening here? Because allowing them a platform didn't work very well last time.
There are a lot of things that are possible but so unlikely that they aren't worth talking about. A colony of ants could randomly spell out the encryption key in the dirt but it is so stupidly unlikely that nobody is going to bother making a post about it. Brute forcing a 256-bit encryption key is the same thing.
I mean, it would be roughly the same chances as you buying one lottery ticket and it being the winning one every day of your life for 100 years. So... probably not.
I would say it is at least a little surprising. I can't find anywhere where it is described how the key was obtained, but it is large enough that it couldn't have been brute forced. And, ostensibly, it only exists inside the secure enclave and in Apple's care. A breach in either place would be surprising.
To clarify though, no security was actually broken here. All he did was decrypt an obfuscated portion of the firmware. This may lead to some vulnerabilities in said firmware being discovered, but as of yet iOS is just as secure as it was yesterday.
Algorithms only prove an upper bound, not a lower bound. Big-Omega means lower bound.
Oh yes, this is definitely true. We can have the P != NP and cryptography is still impossible. Russel Impaggliazzo calls this possibility Pessiland in his famous five worlds paper.
There are plenty of \Omega(n^3) algorithms.
Care to name one?
There also aren't any problems with known upper bounds that are very high, it is either we only know exponential algorithms or we know fairly efficient algorithms. There is no well-known problem that has like a O(n^10) as the best known algorithm.
I used probably in a colloquial sense, like if god came down today and said at midnight he was going to tell us whether factoring is NP-complete I would bet money that it is not. There is no actual probability, it either is or isn't and we just don't know right now. I should have said it would be surprising if it was NP-complete. because that would imply NP = coNP which would be as surprising a result as P = NP.
lolwut? Is this a troll comment and I am just not getting it?
What word would you use to mean, "looks like it proves this but we really don't know yet because there might be a mistake in it and it will probably take months or years to decide if it is valid"?
That is only because factoring is not known to be (and probably isn't) NP-complete. If this result is true, and NP != P, then we do now know for sure that a large class of problems (NP-complete ones) do not have polynomial time algorithms.
x^100 is polynomial time, but not calculable on nearly on the same scale as x^2 or x^3
It is true that there are problems with lower bounds of every possible polynomial (this follows from the time hierarchy theorem), there don't seem to be naturally occurring ones. I don't think there are any proven non-trivial lower bounds for a natural problem that are greater than n^2. Reductions are the same, most are done with very low polynomial complexity. So if a reduction proof was made that showed P = NP it would likely also lead to reasonably efficient algorithms for all problems in P.
new algorithms that don't rely on non-polynomial time calculations will be available
I'm not sure what you are imagining but this is kind of impossible, or at least not very friendly. If we start making encryption schemes that have only a polynomial separation between algorithms that perform the encryption and algorithms that break the encryption then we allow that expensive supercomputers will always be able to break encryption done by cheap, slow devices. This would be a dream for government surveillance.