This is a Kretschmer news story, published by Quanta Magazine, that relates primarily to William Kretschmer news.
For more Kretschmer news, you can click here:
more Kretschmer newsFor more William Kretschmer news, you can click here:
more William Kretschmer newsFor more physics news, you can click here:
more physics newsFor more news from Quanta Magazine, you can click here:
more news from Quanta MagazineOtherweb, Inc is a public benefit corporation, dedicated to improving the quality of news people consume. We are non-partisan, junk-free, and ad-free. We use artificial intelligence (AI) to remove junk from your news feed, and allow you to select the best science news, business news, entertainment news, and much more. If you like physics news, you might also like this article about
quantum cryptographer. We are dedicated to bringing you the highest-quality news, junk-free and ad-free, about your favorite topics. Please come every day to read the latest quantum cryptography news, quantum computations news, physics news, and other high-quality news about any topic that interests you. We are working hard to create the best news aggregator on the web, and to put you in control of your news feed - whether you choose to read the latest news through our website, our news app, or our daily newsletter - all free!
quantum cryptography researcherQuanta Magazine
•83% Informative
Modern encryption methods rely on assumptions about what mathematical problems are hard for computers to solve.
Quantum theory, originally developed to understand the physics of atoms, turned out to have deep connections to information and cryptography.
Researchers focused mainly on a task called bit commitment, which is useful on its own and is also a key component of most advanced cryptographic protocols.
In 2021 , a paper by a graduate student named William Kretschmer prompted researchers to confront a question that nobody had thought to ask.
Computational hardness was clearly necessary for bit commitments and most other forms of cryptography, but precisely what kind of hardness? The answer would turn out to be weirder than anybody had anticipated.
The scope of quantum cryptography was far broader than researchers in the 1990s had realized.
Four researchers proved that Kretschmer ’s state discrimination problem could still be intractable even for computers that could call on this NP oracle.
That means that practically all of quantum cryptography could remain secure even if every problem underpinning classical cryptography turned out to be easy.
“Problems in NP are not the hardest classical problems one can think about,” said Dakshita Khurana .
VR Score
88
Informative language
90
Neutral language
44
Article tone
informal
Language
English
Language complexity
62
Offensive language
not offensive
Hate speech
not hateful
Attention-grabbing headline
not detected
Known propaganda techniques
not detected
Time-value
long-living
External references
3
Source diversity
3
Affiliate links
no affiliate links