Khoth
Joined 10 years ago
Joined 10 years ago
The argument for the Ambrose case is that the surprise isn't him reading silently, it's him reading silently while he has guests. (and elsewhere in the text Augustine mentions himself reading silently by himself in a way that suggests it's entirely normal)
If you can solve any NP-hard problem then you can solve any NP-complete problem (because you can convert any instance of an NP-complete problem to an NP-hard problem), so NP-hard problems are "at least as hard" as NP-complete problems.
(But an NP-hard problem might not be in NP, ie given a purported solution to an NP-hard problem you might not be able to verify it in polynomial time)
The USA has a wide variety, but there are also places like Vietnam where only a handful of family names are in common use and more than 30% of people are Nguyens.
(For example, if an attacker has compromised server A and you connect to it, they can now use your key to connect to server B which you also use)
RSA and ECC cryptography could be broken, but (with a probably rocky transition period) we could move to other algorithms which are still secure.
Crytocurrency I'm not sure about.
I suspect probably keeping it secret - announcing it would push everyone to move from crypto you can break to crypto you can't.
javascript:(function()%20{%20var%20s,e,i,ee=document.getElementsByTagName('*');%20for(i=0;%20e=ee[i];%20i++)%20{%20s=getComputedStyle(e);%20if%20(s%20&&%20s.position%20==%20'fixed')%20e.style.position='static';%20}%20})();Except that it's false because Bard made it up. There's no real curl exploit involved.
https://bugzilla.mozilla.org/show_bug.cgi?id=2083449#c30 They're being asked some very pointed questions about why they encountered problems with the key generation process at the time but didn't properly investigate.