DailyDirt: Trust In Math
from the urls-we-dig-up dept
We'll know things are really going wrong when government authorities are trying to innovate their way around math. (And maybe we're already headed that way with backdoors to encryption.) Hopefully, though, we'll be able to trust in math for the foreseeable future, and nevermind about the Banach-Tarski paradox. Math is hard.- If you thought that quantum cryptography would someday solve all the problems of unauthorized eavesdroppers, some researchers have shown that we'll have to be a bit more careful. Using the Bell inequality to check for attackers isn't necessarily sufficient to certify a quantum key distribution (QKD) as secure, as an eavesdropper could use some quantum hacking to compromise a system with fake detectors. Fortunately, some additional tests can reestablish security and protect against current and future attacks of a specific type. [url]
- Keeping anonymous communications networks anonymous is a bit harder if you can't guarantee there isn't an adversary with the resources to compromise a significant fraction of the network. One solution to this problem might be to include some obfuscation and noise to the network -- and as long as one out of three nodes isn't compromised, messages will be anonymous and untraceable. [url]
- The math challenge of 'graph isomorphism' is supposed to be tough, but if it's downgraded to a less difficult problem, then we might have to move away from number factoring for securing encryption. An algorithmic breakthrough for factoring could allow powerful computers to break into encrypted messages. This wouldn't be the first time we've had to change encryption methods, but this would be a significant development now, given the widespread use of encryption technology that relies on factoring. [url]
Thank you for reading this Techdirt post. With so many things competing for everyone’s attention these days, we really appreciate you giving us your time. We work hard every day to put quality content out there for our community.
Techdirt is one of the few remaining truly independent media outlets. We do not have a giant corporation behind us, and we rely heavily on our community to support us, in an age when advertisers are increasingly uninterested in sponsoring small, independent sites — especially a site like ours that is unwilling to pull punches in its reporting and analysis.
While other websites have resorted to paywalls, registration requirements, and increasingly annoying/intrusive advertising, we have always kept Techdirt open and available to anyone. But in order to continue doing so, we need your support. We offer a variety of ways for our readers to support us, from direct donations to special subscriptions and cool merchandise — and every little bit helps. Thank you.
–The Techdirt Team
Filed Under: backdoors, banach-tarski paradox, cryptography, encryption, graph isomorphism, math, qkd, quantum cryptography, quantum hacking, quantum key distribution, security
Reader Comments
The First Word
“Subscribe: RSS
View by: Time | Thread
This raises the possibility that the Republican Party is actually holding an intelligent and well-reasoned policy debate in total secrecy, with certain candidates there to contribute obfuscation and noise.
[ link to this | view in chronology ]
[ link to this | view in chronology ]
Re:
[ link to this | view in chronology ]
Re: Re:
[ link to this | view in chronology ]
Re: Re: Re:
[ link to this | view in chronology ]
Re: Re:
Not sure what is meant by "trust in math", like you trust the bank math so you do not check your account balance?
[ link to this | view in chronology ]
Re: Re: Re:
[ link to this | view in chronology ]
What about quatum computers?
You'll be able to encrypt and decrypt everything.
[ link to this | view in chronology ]