This is a news story, published by Wired, that relates primarily to William Kretschmer news.
For 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 Wired, you can click here:
more news from WiredOtherweb, 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, many quantum cryptography techniques 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 researcherWired
•85% Informative
In the 1980s , Charles Bennett and Gilles Brassard pioneered a new approach to cryptography based on quantum physics.
In a string of recent papers, researchers have shown that most cryptographic tasks could still be accomplished securely even in hypothetical worlds where practically all computation is easy.
There are some clever tricks for solving the hardest problems that seem to seem to be impossible.
In 1997 , two papers proved that bit commitment schemes could never be completely secure if they were based solely on the laws of quantum physics.
But 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 what kind of hardness?.
In 2022 , William Kretschmer and Qian began working together to see what they could prove about an oracle that could solve any NP problem instantaneously.
In a world with such oracles, all classical cryptography would be impossible.
But four researchers proved that such oracle could still be intractable even for computers that could call on this NP oracle.
That means practically all of quantum cryptography could remain secure even if every problem underpinning classical cryptography is easy.
VR Score
88
Informative language
88
Neutral language
41
Article tone
informal
Language
English
Language complexity
64
Offensive language
not offensive
Hate speech
not hateful
Attention-grabbing headline
not detected
Known propaganda techniques
not detected
Time-value
long-living
External references
30
Source diversity
13
Affiliate links
no affiliate links